./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9a705622-69e5-4a50-b307-38115586d54f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9a705622-69e5-4a50-b307-38115586d54f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9a705622-69e5-4a50-b307-38115586d54f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9a705622-69e5-4a50-b307-38115586d54f/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9a705622-69e5-4a50-b307-38115586d54f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9a705622-69e5-4a50-b307-38115586d54f/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f7b0b589689413087c164ce10eb80c902ee4046 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:27:50,676 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:27:50,677 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:27:50,684 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:27:50,684 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:27:50,685 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:27:50,686 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:27:50,687 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:27:50,688 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:27:50,689 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:27:50,689 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:27:50,689 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:27:50,690 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:27:50,691 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:27:50,691 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:27:50,692 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:27:50,693 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:27:50,694 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:27:50,695 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:27:50,696 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:27:50,697 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:27:50,698 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:27:50,700 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:27:50,700 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:27:50,700 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:27:50,701 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:27:50,702 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:27:50,702 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:27:50,703 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:27:50,703 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:27:50,703 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:27:50,704 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:27:50,704 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:27:50,704 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:27:50,704 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:27:50,705 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:27:50,705 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9a705622-69e5-4a50-b307-38115586d54f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 12:27:50,713 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:27:50,713 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:27:50,713 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 12:27:50,714 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 12:27:50,714 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:27:50,714 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:27:50,714 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:27:50,715 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:27:50,715 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:27:50,715 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:27:50,715 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:27:50,715 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:27:50,715 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 12:27:50,715 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 12:27:50,715 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 12:27:50,716 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:27:50,716 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:27:50,716 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:27:50,716 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 12:27:50,716 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:27:50,716 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:27:50,716 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 12:27:50,717 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 12:27:50,717 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:27:50,717 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:27:50,717 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 12:27:50,717 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 12:27:50,717 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:27:50,717 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 12:27:50,718 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 12:27:50,718 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_9a705622-69e5-4a50-b307-38115586d54f/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f7b0b589689413087c164ce10eb80c902ee4046 [2018-11-28 12:27:50,742 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:27:50,751 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:27:50,753 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:27:50,755 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:27:50,755 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:27:50,755 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9a705622-69e5-4a50-b307-38115586d54f/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 12:27:50,801 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a705622-69e5-4a50-b307-38115586d54f/bin-2019/uautomizer/data/7c33cc861/0657a65f2b1941f4b4f5bce1a636cd32/FLAG0590d3088 [2018-11-28 12:27:51,194 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:27:51,194 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9a705622-69e5-4a50-b307-38115586d54f/sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 12:27:51,198 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a705622-69e5-4a50-b307-38115586d54f/bin-2019/uautomizer/data/7c33cc861/0657a65f2b1941f4b4f5bce1a636cd32/FLAG0590d3088 [2018-11-28 12:27:51,206 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9a705622-69e5-4a50-b307-38115586d54f/bin-2019/uautomizer/data/7c33cc861/0657a65f2b1941f4b4f5bce1a636cd32 [2018-11-28 12:27:51,208 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:27:51,209 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:27:51,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:27:51,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:27:51,212 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:27:51,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:27:51" (1/1) ... [2018-11-28 12:27:51,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e97e36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:51, skipping insertion in model container [2018-11-28 12:27:51,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:27:51" (1/1) ... [2018-11-28 12:27:51,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:27:51,231 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:27:51,325 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:27:51,328 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:27:51,347 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:27:51,357 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:27:51,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:51 WrapperNode [2018-11-28 12:27:51,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:27:51,358 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:27:51,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:27:51,358 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:27:51,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:51" (1/1) ... [2018-11-28 12:27:51,367 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:51" (1/1) ... [2018-11-28 12:27:51,371 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:27:51,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:27:51,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:27:51,371 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:27:51,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:51" (1/1) ... [2018-11-28 12:27:51,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:51" (1/1) ... [2018-11-28 12:27:51,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:51" (1/1) ... [2018-11-28 12:27:51,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:51" (1/1) ... [2018-11-28 12:27:51,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:51" (1/1) ... [2018-11-28 12:27:51,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:51" (1/1) ... [2018-11-28 12:27:51,430 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:51" (1/1) ... [2018-11-28 12:27:51,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:27:51,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:27:51,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:27:51,432 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:27:51,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a705622-69e5-4a50-b307-38115586d54f/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-28 12:27:51,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 12:27:51,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 12:27:51,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:27:51,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:27:51,478 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 12:27:51,478 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 12:27:51,707 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:27:51,707 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 12:27:51,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:27:51 BoogieIcfgContainer [2018-11-28 12:27:51,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:27:51,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 12:27:51,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 12:27:51,710 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 12:27:51,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:27:51" (1/3) ... [2018-11-28 12:27:51,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704284ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:27:51, skipping insertion in model container [2018-11-28 12:27:51,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:51" (2/3) ... [2018-11-28 12:27:51,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704284ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:27:51, skipping insertion in model container [2018-11-28 12:27:51,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:27:51" (3/3) ... [2018-11-28 12:27:51,713 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 12:27:51,722 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 12:27:51,729 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 12:27:51,744 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 12:27:51,770 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:27:51,770 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 12:27:51,771 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 12:27:51,771 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 12:27:51,771 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:27:51,771 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:27:51,771 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 12:27:51,771 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:27:51,771 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 12:27:51,786 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-28 12:27:51,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 12:27:51,792 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:51,792 INFO L402 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-28 12:27:51,794 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:51,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:51,799 INFO L82 PathProgramCache]: Analyzing trace with hash -917347053, now seen corresponding path program 1 times [2018-11-28 12:27:51,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:51,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:51,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:51,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:51,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:51,945 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-28 12:27:51,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:51,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:51,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:51,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:51,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:51,964 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2018-11-28 12:27:52,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:52,005 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2018-11-28 12:27:52,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:52,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 12:27:52,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:52,014 INFO L225 Difference]: With dead ends: 87 [2018-11-28 12:27:52,014 INFO L226 Difference]: Without dead ends: 72 [2018-11-28 12:27:52,016 INFO L631 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-28 12:27:52,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-28 12:27:52,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2018-11-28 12:27:52,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-28 12:27:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 89 transitions. [2018-11-28 12:27:52,041 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 89 transitions. Word has length 20 [2018-11-28 12:27:52,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:52,042 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 89 transitions. [2018-11-28 12:27:52,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:52,042 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 89 transitions. [2018-11-28 12:27:52,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 12:27:52,042 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:52,042 INFO L402 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-28 12:27:52,043 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:52,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:52,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1504153067, now seen corresponding path program 1 times [2018-11-28 12:27:52,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:52,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:52,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:52,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:52,077 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-28 12:27:52,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:52,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:52,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:52,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:52,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:52,080 INFO L87 Difference]: Start difference. First operand 50 states and 89 transitions. Second operand 3 states. [2018-11-28 12:27:52,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:52,107 INFO L93 Difference]: Finished difference Result 117 states and 212 transitions. [2018-11-28 12:27:52,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:52,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 12:27:52,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:52,109 INFO L225 Difference]: With dead ends: 117 [2018-11-28 12:27:52,109 INFO L226 Difference]: Without dead ends: 72 [2018-11-28 12:27:52,110 INFO L631 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-28 12:27:52,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-28 12:27:52,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-11-28 12:27:52,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-28 12:27:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 125 transitions. [2018-11-28 12:27:52,117 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 125 transitions. Word has length 20 [2018-11-28 12:27:52,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:52,117 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 125 transitions. [2018-11-28 12:27:52,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:52,117 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 125 transitions. [2018-11-28 12:27:52,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 12:27:52,118 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:52,118 INFO L402 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-28 12:27:52,118 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:52,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:52,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1627225809, now seen corresponding path program 1 times [2018-11-28 12:27:52,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:52,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:52,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:52,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:52,161 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-28 12:27:52,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:52,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:52,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:52,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:52,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:52,164 INFO L87 Difference]: Start difference. First operand 70 states and 125 transitions. Second operand 3 states. [2018-11-28 12:27:52,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:52,198 INFO L93 Difference]: Finished difference Result 108 states and 189 transitions. [2018-11-28 12:27:52,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:52,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 12:27:52,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:52,199 INFO L225 Difference]: With dead ends: 108 [2018-11-28 12:27:52,199 INFO L226 Difference]: Without dead ends: 75 [2018-11-28 12:27:52,199 INFO L631 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-28 12:27:52,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-28 12:27:52,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-11-28 12:27:52,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-28 12:27:52,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 127 transitions. [2018-11-28 12:27:52,204 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 127 transitions. Word has length 21 [2018-11-28 12:27:52,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:52,204 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 127 transitions. [2018-11-28 12:27:52,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:52,204 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2018-11-28 12:27:52,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 12:27:52,204 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:52,205 INFO L402 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-28 12:27:52,205 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:52,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:52,205 INFO L82 PathProgramCache]: Analyzing trace with hash 616108559, now seen corresponding path program 1 times [2018-11-28 12:27:52,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:52,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:52,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:52,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:52,234 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-28 12:27:52,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:52,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:52,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:52,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:52,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:52,235 INFO L87 Difference]: Start difference. First operand 73 states and 127 transitions. Second operand 3 states. [2018-11-28 12:27:52,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:52,261 INFO L93 Difference]: Finished difference Result 136 states and 240 transitions. [2018-11-28 12:27:52,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:52,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 12:27:52,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:52,263 INFO L225 Difference]: With dead ends: 136 [2018-11-28 12:27:52,263 INFO L226 Difference]: Without dead ends: 134 [2018-11-28 12:27:52,263 INFO L631 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-28 12:27:52,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-28 12:27:52,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2018-11-28 12:27:52,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-28 12:27:52,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 168 transitions. [2018-11-28 12:27:52,271 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 168 transitions. Word has length 21 [2018-11-28 12:27:52,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:52,272 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 168 transitions. [2018-11-28 12:27:52,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:52,272 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 168 transitions. [2018-11-28 12:27:52,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 12:27:52,272 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:52,273 INFO L402 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-28 12:27:52,273 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:52,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:52,273 INFO L82 PathProgramCache]: Analyzing trace with hash 29302545, now seen corresponding path program 1 times [2018-11-28 12:27:52,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:52,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:52,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:52,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:52,308 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-28 12:27:52,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:52,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:52,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:52,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:52,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:52,310 INFO L87 Difference]: Start difference. First operand 96 states and 168 transitions. Second operand 3 states. [2018-11-28 12:27:52,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:52,324 INFO L93 Difference]: Finished difference Result 224 states and 398 transitions. [2018-11-28 12:27:52,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:52,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 12:27:52,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:52,325 INFO L225 Difference]: With dead ends: 224 [2018-11-28 12:27:52,325 INFO L226 Difference]: Without dead ends: 136 [2018-11-28 12:27:52,326 INFO L631 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-28 12:27:52,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-28 12:27:52,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-11-28 12:27:52,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-28 12:27:52,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 234 transitions. [2018-11-28 12:27:52,332 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 234 transitions. Word has length 21 [2018-11-28 12:27:52,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:52,333 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 234 transitions. [2018-11-28 12:27:52,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:52,333 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 234 transitions. [2018-11-28 12:27:52,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 12:27:52,334 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:52,334 INFO L402 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-28 12:27:52,334 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:52,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:52,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1919709866, now seen corresponding path program 1 times [2018-11-28 12:27:52,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:52,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:52,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:52,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:52,363 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-28 12:27:52,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:52,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:52,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:52,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:52,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:52,365 INFO L87 Difference]: Start difference. First operand 134 states and 234 transitions. Second operand 3 states. [2018-11-28 12:27:52,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:52,374 INFO L93 Difference]: Finished difference Result 201 states and 349 transitions. [2018-11-28 12:27:52,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:52,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 12:27:52,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:52,375 INFO L225 Difference]: With dead ends: 201 [2018-11-28 12:27:52,375 INFO L226 Difference]: Without dead ends: 138 [2018-11-28 12:27:52,376 INFO L631 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-28 12:27:52,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-28 12:27:52,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-11-28 12:27:52,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-28 12:27:52,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 234 transitions. [2018-11-28 12:27:52,381 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 234 transitions. Word has length 22 [2018-11-28 12:27:52,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:52,381 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 234 transitions. [2018-11-28 12:27:52,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:52,381 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 234 transitions. [2018-11-28 12:27:52,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 12:27:52,382 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:52,382 INFO L402 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-28 12:27:52,382 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:52,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:52,382 INFO L82 PathProgramCache]: Analyzing trace with hash 908592616, now seen corresponding path program 1 times [2018-11-28 12:27:52,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:52,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:52,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:52,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:52,411 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-28 12:27:52,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:52,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:52,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:52,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:52,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:52,412 INFO L87 Difference]: Start difference. First operand 136 states and 234 transitions. Second operand 3 states. [2018-11-28 12:27:52,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:52,428 INFO L93 Difference]: Finished difference Result 252 states and 440 transitions. [2018-11-28 12:27:52,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:52,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 12:27:52,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:52,430 INFO L225 Difference]: With dead ends: 252 [2018-11-28 12:27:52,430 INFO L226 Difference]: Without dead ends: 250 [2018-11-28 12:27:52,431 INFO L631 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-28 12:27:52,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-28 12:27:52,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 184. [2018-11-28 12:27:52,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-28 12:27:52,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 314 transitions. [2018-11-28 12:27:52,443 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 314 transitions. Word has length 22 [2018-11-28 12:27:52,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:52,443 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 314 transitions. [2018-11-28 12:27:52,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:52,444 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 314 transitions. [2018-11-28 12:27:52,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 12:27:52,445 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:52,445 INFO L402 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-28 12:27:52,445 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:52,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:52,445 INFO L82 PathProgramCache]: Analyzing trace with hash 321786602, now seen corresponding path program 1 times [2018-11-28 12:27:52,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:52,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:52,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:52,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:52,468 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-28 12:27:52,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:52,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:52,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:52,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:52,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:52,469 INFO L87 Difference]: Start difference. First operand 184 states and 314 transitions. Second operand 3 states. [2018-11-28 12:27:52,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:52,493 INFO L93 Difference]: Finished difference Result 432 states and 744 transitions. [2018-11-28 12:27:52,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:52,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 12:27:52,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:52,495 INFO L225 Difference]: With dead ends: 432 [2018-11-28 12:27:52,495 INFO L226 Difference]: Without dead ends: 258 [2018-11-28 12:27:52,496 INFO L631 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-28 12:27:52,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-28 12:27:52,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-11-28 12:27:52,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-28 12:27:52,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 434 transitions. [2018-11-28 12:27:52,508 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 434 transitions. Word has length 22 [2018-11-28 12:27:52,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:52,508 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 434 transitions. [2018-11-28 12:27:52,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:52,508 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 434 transitions. [2018-11-28 12:27:52,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 12:27:52,511 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:52,511 INFO L402 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-28 12:27:52,511 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:52,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:52,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1898185914, now seen corresponding path program 1 times [2018-11-28 12:27:52,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:52,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:52,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:52,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:52,537 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-28 12:27:52,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:52,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:52,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:52,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:52,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:52,538 INFO L87 Difference]: Start difference. First operand 256 states and 434 transitions. Second operand 3 states. [2018-11-28 12:27:52,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:52,553 INFO L93 Difference]: Finished difference Result 384 states and 648 transitions. [2018-11-28 12:27:52,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:52,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 12:27:52,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:52,555 INFO L225 Difference]: With dead ends: 384 [2018-11-28 12:27:52,555 INFO L226 Difference]: Without dead ends: 262 [2018-11-28 12:27:52,555 INFO L631 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-28 12:27:52,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-11-28 12:27:52,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-11-28 12:27:52,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-28 12:27:52,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2018-11-28 12:27:52,564 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 23 [2018-11-28 12:27:52,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:52,564 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2018-11-28 12:27:52,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:52,564 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2018-11-28 12:27:52,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 12:27:52,565 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:52,565 INFO L402 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-28 12:27:52,565 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:52,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:52,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1385664132, now seen corresponding path program 1 times [2018-11-28 12:27:52,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:52,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:52,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:52,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:52,581 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-28 12:27:52,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:52,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:52,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:52,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:52,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:52,582 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand 3 states. [2018-11-28 12:27:52,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:52,617 INFO L93 Difference]: Finished difference Result 476 states and 808 transitions. [2018-11-28 12:27:52,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:52,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 12:27:52,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:52,620 INFO L225 Difference]: With dead ends: 476 [2018-11-28 12:27:52,620 INFO L226 Difference]: Without dead ends: 474 [2018-11-28 12:27:52,621 INFO L631 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-28 12:27:52,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-11-28 12:27:52,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 360. [2018-11-28 12:27:52,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-11-28 12:27:52,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 590 transitions. [2018-11-28 12:27:52,630 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 590 transitions. Word has length 23 [2018-11-28 12:27:52,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:52,630 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 590 transitions. [2018-11-28 12:27:52,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:52,630 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 590 transitions. [2018-11-28 12:27:52,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 12:27:52,631 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:52,631 INFO L402 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-28 12:27:52,632 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:52,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:52,632 INFO L82 PathProgramCache]: Analyzing trace with hash 798858118, now seen corresponding path program 1 times [2018-11-28 12:27:52,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:52,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:52,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:52,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:52,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:27:52,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:52,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:52,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:52,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:52,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:52,664 INFO L87 Difference]: Start difference. First operand 360 states and 590 transitions. Second operand 3 states. [2018-11-28 12:27:52,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:52,701 INFO L93 Difference]: Finished difference Result 844 states and 1392 transitions. [2018-11-28 12:27:52,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:52,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 12:27:52,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:52,704 INFO L225 Difference]: With dead ends: 844 [2018-11-28 12:27:52,704 INFO L226 Difference]: Without dead ends: 498 [2018-11-28 12:27:52,705 INFO L631 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-28 12:27:52,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-11-28 12:27:52,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2018-11-28 12:27:52,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-11-28 12:27:52,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 806 transitions. [2018-11-28 12:27:52,723 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 806 transitions. Word has length 23 [2018-11-28 12:27:52,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:52,723 INFO L480 AbstractCegarLoop]: Abstraction has 496 states and 806 transitions. [2018-11-28 12:27:52,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:52,723 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 806 transitions. [2018-11-28 12:27:52,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 12:27:52,724 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:52,725 INFO L402 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-28 12:27:52,725 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:52,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:52,725 INFO L82 PathProgramCache]: Analyzing trace with hash 6129535, now seen corresponding path program 1 times [2018-11-28 12:27:52,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:52,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:52,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:52,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:52,749 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-28 12:27:52,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:52,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:52,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:52,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:52,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:52,750 INFO L87 Difference]: Start difference. First operand 496 states and 806 transitions. Second operand 3 states. [2018-11-28 12:27:52,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:52,779 INFO L93 Difference]: Finished difference Result 744 states and 1204 transitions. [2018-11-28 12:27:52,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:52,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 12:27:52,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:52,781 INFO L225 Difference]: With dead ends: 744 [2018-11-28 12:27:52,781 INFO L226 Difference]: Without dead ends: 506 [2018-11-28 12:27:52,782 INFO L631 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-28 12:27:52,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-11-28 12:27:52,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2018-11-28 12:27:52,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-11-28 12:27:52,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 806 transitions. [2018-11-28 12:27:52,799 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 806 transitions. Word has length 24 [2018-11-28 12:27:52,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:52,800 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 806 transitions. [2018-11-28 12:27:52,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:52,800 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 806 transitions. [2018-11-28 12:27:52,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 12:27:52,801 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:52,801 INFO L402 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-28 12:27:52,801 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:52,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:52,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1004987715, now seen corresponding path program 1 times [2018-11-28 12:27:52,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:52,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:52,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:52,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:52,820 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-28 12:27:52,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:52,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:52,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:52,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:52,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:52,821 INFO L87 Difference]: Start difference. First operand 504 states and 806 transitions. Second operand 3 states. [2018-11-28 12:27:52,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:52,848 INFO L93 Difference]: Finished difference Result 908 states and 1480 transitions. [2018-11-28 12:27:52,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:52,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 12:27:52,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:52,851 INFO L225 Difference]: With dead ends: 908 [2018-11-28 12:27:52,851 INFO L226 Difference]: Without dead ends: 906 [2018-11-28 12:27:52,852 INFO L631 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-28 12:27:52,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2018-11-28 12:27:52,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 712. [2018-11-28 12:27:52,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2018-11-28 12:27:52,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1110 transitions. [2018-11-28 12:27:52,874 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1110 transitions. Word has length 24 [2018-11-28 12:27:52,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:52,874 INFO L480 AbstractCegarLoop]: Abstraction has 712 states and 1110 transitions. [2018-11-28 12:27:52,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:52,875 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1110 transitions. [2018-11-28 12:27:52,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 12:27:52,876 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:52,876 INFO L402 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-28 12:27:52,876 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:52,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:52,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1591793729, now seen corresponding path program 1 times [2018-11-28 12:27:52,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:52,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:52,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:52,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:52,902 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-28 12:27:52,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:52,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:52,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:52,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:52,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:52,903 INFO L87 Difference]: Start difference. First operand 712 states and 1110 transitions. Second operand 3 states. [2018-11-28 12:27:52,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:52,931 INFO L93 Difference]: Finished difference Result 1660 states and 2600 transitions. [2018-11-28 12:27:52,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:52,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 12:27:52,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:52,935 INFO L225 Difference]: With dead ends: 1660 [2018-11-28 12:27:52,935 INFO L226 Difference]: Without dead ends: 970 [2018-11-28 12:27:52,938 INFO L631 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-28 12:27:52,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2018-11-28 12:27:52,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 968. [2018-11-28 12:27:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2018-11-28 12:27:52,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1494 transitions. [2018-11-28 12:27:52,968 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1494 transitions. Word has length 24 [2018-11-28 12:27:52,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:52,968 INFO L480 AbstractCegarLoop]: Abstraction has 968 states and 1494 transitions. [2018-11-28 12:27:52,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:52,968 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1494 transitions. [2018-11-28 12:27:52,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 12:27:52,969 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:52,969 INFO L402 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-28 12:27:52,970 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:52,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:52,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1089633349, now seen corresponding path program 1 times [2018-11-28 12:27:52,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:52,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:52,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:52,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:52,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:27:52,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:52,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:52,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:52,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:52,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:52,986 INFO L87 Difference]: Start difference. First operand 968 states and 1494 transitions. Second operand 3 states. [2018-11-28 12:27:53,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:53,013 INFO L93 Difference]: Finished difference Result 1452 states and 2232 transitions. [2018-11-28 12:27:53,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:53,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 12:27:53,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:53,017 INFO L225 Difference]: With dead ends: 1452 [2018-11-28 12:27:53,017 INFO L226 Difference]: Without dead ends: 986 [2018-11-28 12:27:53,018 INFO L631 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-28 12:27:53,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2018-11-28 12:27:53,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2018-11-28 12:27:53,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2018-11-28 12:27:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1494 transitions. [2018-11-28 12:27:53,049 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1494 transitions. Word has length 25 [2018-11-28 12:27:53,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:53,050 INFO L480 AbstractCegarLoop]: Abstraction has 984 states and 1494 transitions. [2018-11-28 12:27:53,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:53,050 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1494 transitions. [2018-11-28 12:27:53,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 12:27:53,051 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:53,051 INFO L402 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-28 12:27:53,051 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:53,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:53,052 INFO L82 PathProgramCache]: Analyzing trace with hash -2100750599, now seen corresponding path program 1 times [2018-11-28 12:27:53,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:53,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:53,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:53,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:53,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:53,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:27:53,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:53,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:53,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:53,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:53,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:53,075 INFO L87 Difference]: Start difference. First operand 984 states and 1494 transitions. Second operand 3 states. [2018-11-28 12:27:53,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:53,119 INFO L93 Difference]: Finished difference Result 1740 states and 2696 transitions. [2018-11-28 12:27:53,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:53,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 12:27:53,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:53,125 INFO L225 Difference]: With dead ends: 1740 [2018-11-28 12:27:53,125 INFO L226 Difference]: Without dead ends: 1738 [2018-11-28 12:27:53,126 INFO L631 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-28 12:27:53,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-11-28 12:27:53,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1416. [2018-11-28 12:27:53,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2018-11-28 12:27:53,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2086 transitions. [2018-11-28 12:27:53,169 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2086 transitions. Word has length 25 [2018-11-28 12:27:53,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:53,169 INFO L480 AbstractCegarLoop]: Abstraction has 1416 states and 2086 transitions. [2018-11-28 12:27:53,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:53,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2086 transitions. [2018-11-28 12:27:53,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 12:27:53,172 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:53,172 INFO L402 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-28 12:27:53,172 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:53,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:53,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1607410683, now seen corresponding path program 1 times [2018-11-28 12:27:53,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:53,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:53,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:53,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:53,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:53,187 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-28 12:27:53,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:53,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:53,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:53,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:53,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:53,189 INFO L87 Difference]: Start difference. First operand 1416 states and 2086 transitions. Second operand 3 states. [2018-11-28 12:27:53,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:53,235 INFO L93 Difference]: Finished difference Result 3276 states and 4840 transitions. [2018-11-28 12:27:53,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:53,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 12:27:53,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:53,241 INFO L225 Difference]: With dead ends: 3276 [2018-11-28 12:27:53,242 INFO L226 Difference]: Without dead ends: 1898 [2018-11-28 12:27:53,244 INFO L631 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-28 12:27:53,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2018-11-28 12:27:53,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2018-11-28 12:27:53,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2018-11-28 12:27:53,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2758 transitions. [2018-11-28 12:27:53,298 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2758 transitions. Word has length 25 [2018-11-28 12:27:53,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:53,299 INFO L480 AbstractCegarLoop]: Abstraction has 1896 states and 2758 transitions. [2018-11-28 12:27:53,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:53,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2758 transitions. [2018-11-28 12:27:53,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 12:27:53,302 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:53,302 INFO L402 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-28 12:27:53,302 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:53,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:53,302 INFO L82 PathProgramCache]: Analyzing trace with hash -698544044, now seen corresponding path program 1 times [2018-11-28 12:27:53,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:53,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:53,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:53,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:53,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:53,326 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-28 12:27:53,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:53,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:53,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:53,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:53,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:53,327 INFO L87 Difference]: Start difference. First operand 1896 states and 2758 transitions. Second operand 3 states. [2018-11-28 12:27:53,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:53,373 INFO L93 Difference]: Finished difference Result 2844 states and 4120 transitions. [2018-11-28 12:27:53,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:53,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 12:27:53,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:53,379 INFO L225 Difference]: With dead ends: 2844 [2018-11-28 12:27:53,379 INFO L226 Difference]: Without dead ends: 1930 [2018-11-28 12:27:53,382 INFO L631 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-28 12:27:53,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2018-11-28 12:27:53,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2018-11-28 12:27:53,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-11-28 12:27:53,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2758 transitions. [2018-11-28 12:27:53,473 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2758 transitions. Word has length 26 [2018-11-28 12:27:53,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:53,473 INFO L480 AbstractCegarLoop]: Abstraction has 1928 states and 2758 transitions. [2018-11-28 12:27:53,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:53,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2758 transitions. [2018-11-28 12:27:53,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 12:27:53,475 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:53,475 INFO L402 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-28 12:27:53,475 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:53,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:53,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1709661294, now seen corresponding path program 1 times [2018-11-28 12:27:53,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:53,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:53,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:53,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:53,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:53,502 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-28 12:27:53,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:53,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:53,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:53,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:53,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:53,503 INFO L87 Difference]: Start difference. First operand 1928 states and 2758 transitions. Second operand 3 states. [2018-11-28 12:27:53,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:53,576 INFO L93 Difference]: Finished difference Result 3340 states and 4872 transitions. [2018-11-28 12:27:53,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:53,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 12:27:53,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:53,587 INFO L225 Difference]: With dead ends: 3340 [2018-11-28 12:27:53,587 INFO L226 Difference]: Without dead ends: 3338 [2018-11-28 12:27:53,588 INFO L631 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-28 12:27:53,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2018-11-28 12:27:53,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2824. [2018-11-28 12:27:53,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2018-11-28 12:27:53,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3910 transitions. [2018-11-28 12:27:53,669 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3910 transitions. Word has length 26 [2018-11-28 12:27:53,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:53,669 INFO L480 AbstractCegarLoop]: Abstraction has 2824 states and 3910 transitions. [2018-11-28 12:27:53,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:53,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3910 transitions. [2018-11-28 12:27:53,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 12:27:53,673 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:53,673 INFO L402 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-28 12:27:53,673 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:53,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:53,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1998499988, now seen corresponding path program 1 times [2018-11-28 12:27:53,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:53,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:53,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:53,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:53,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:53,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:27:53,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:53,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:53,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:53,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:53,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:53,705 INFO L87 Difference]: Start difference. First operand 2824 states and 3910 transitions. Second operand 3 states. [2018-11-28 12:27:53,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:53,819 INFO L93 Difference]: Finished difference Result 6476 states and 8968 transitions. [2018-11-28 12:27:53,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:53,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 12:27:53,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:53,829 INFO L225 Difference]: With dead ends: 6476 [2018-11-28 12:27:53,829 INFO L226 Difference]: Without dead ends: 3722 [2018-11-28 12:27:53,833 INFO L631 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-28 12:27:53,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2018-11-28 12:27:53,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3720. [2018-11-28 12:27:53,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2018-11-28 12:27:53,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5062 transitions. [2018-11-28 12:27:53,938 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5062 transitions. Word has length 26 [2018-11-28 12:27:53,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:53,938 INFO L480 AbstractCegarLoop]: Abstraction has 3720 states and 5062 transitions. [2018-11-28 12:27:53,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:53,938 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5062 transitions. [2018-11-28 12:27:53,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 12:27:53,944 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:53,944 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:27:53,945 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:53,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:53,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1459677136, now seen corresponding path program 1 times [2018-11-28 12:27:53,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:53,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:53,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:53,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:53,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:53,983 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-28 12:27:53,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:53,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:53,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:53,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:53,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:53,984 INFO L87 Difference]: Start difference. First operand 3720 states and 5062 transitions. Second operand 3 states. [2018-11-28 12:27:54,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:54,056 INFO L93 Difference]: Finished difference Result 5580 states and 7560 transitions. [2018-11-28 12:27:54,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:54,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 12:27:54,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:54,068 INFO L225 Difference]: With dead ends: 5580 [2018-11-28 12:27:54,068 INFO L226 Difference]: Without dead ends: 3786 [2018-11-28 12:27:54,072 INFO L631 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-28 12:27:54,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2018-11-28 12:27:54,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2018-11-28 12:27:54,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2018-11-28 12:27:54,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5062 transitions. [2018-11-28 12:27:54,179 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5062 transitions. Word has length 27 [2018-11-28 12:27:54,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:54,179 INFO L480 AbstractCegarLoop]: Abstraction has 3784 states and 5062 transitions. [2018-11-28 12:27:54,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:54,179 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5062 transitions. [2018-11-28 12:27:54,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 12:27:54,183 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:54,183 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:27:54,183 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:54,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:54,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1824172910, now seen corresponding path program 1 times [2018-11-28 12:27:54,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:54,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:54,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:54,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:54,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:54,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-28 12:27:54,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:54,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:54,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:54,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:54,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:54,203 INFO L87 Difference]: Start difference. First operand 3784 states and 5062 transitions. Second operand 3 states. [2018-11-28 12:27:54,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:54,330 INFO L93 Difference]: Finished difference Result 10956 states and 14408 transitions. [2018-11-28 12:27:54,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:54,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 12:27:54,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:54,349 INFO L225 Difference]: With dead ends: 10956 [2018-11-28 12:27:54,349 INFO L226 Difference]: Without dead ends: 7306 [2018-11-28 12:27:54,355 INFO L631 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-28 12:27:54,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2018-11-28 12:27:54,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7304. [2018-11-28 12:27:54,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2018-11-28 12:27:54,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9350 transitions. [2018-11-28 12:27:54,543 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9350 transitions. Word has length 27 [2018-11-28 12:27:54,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:54,543 INFO L480 AbstractCegarLoop]: Abstraction has 7304 states and 9350 transitions. [2018-11-28 12:27:54,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:54,543 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9350 transitions. [2018-11-28 12:27:54,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 12:27:54,551 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:54,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:27:54,551 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:54,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:54,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1883988372, now seen corresponding path program 1 times [2018-11-28 12:27:54,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:54,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:54,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:54,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:54,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:54,567 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-28 12:27:54,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:54,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:54,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:54,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:54,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:54,568 INFO L87 Difference]: Start difference. First operand 7304 states and 9350 transitions. Second operand 3 states. [2018-11-28 12:27:54,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:54,733 INFO L93 Difference]: Finished difference Result 8076 states and 10632 transitions. [2018-11-28 12:27:54,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:54,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 12:27:54,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:54,746 INFO L225 Difference]: With dead ends: 8076 [2018-11-28 12:27:54,747 INFO L226 Difference]: Without dead ends: 8074 [2018-11-28 12:27:54,749 INFO L631 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-28 12:27:54,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2018-11-28 12:27:54,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 7304. [2018-11-28 12:27:54,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2018-11-28 12:27:54,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9222 transitions. [2018-11-28 12:27:54,924 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9222 transitions. Word has length 27 [2018-11-28 12:27:54,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:54,924 INFO L480 AbstractCegarLoop]: Abstraction has 7304 states and 9222 transitions. [2018-11-28 12:27:54,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:54,924 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9222 transitions. [2018-11-28 12:27:54,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 12:27:54,930 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:54,930 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:27:54,931 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:54,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:54,931 INFO L82 PathProgramCache]: Analyzing trace with hash 715001129, now seen corresponding path program 1 times [2018-11-28 12:27:54,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:54,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:54,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:54,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:54,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:54,955 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-28 12:27:54,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:54,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:54,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:54,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:54,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:54,956 INFO L87 Difference]: Start difference. First operand 7304 states and 9222 transitions. Second operand 3 states. [2018-11-28 12:27:55,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:55,083 INFO L93 Difference]: Finished difference Result 12172 states and 15496 transitions. [2018-11-28 12:27:55,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:55,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 12:27:55,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:55,100 INFO L225 Difference]: With dead ends: 12172 [2018-11-28 12:27:55,100 INFO L226 Difference]: Without dead ends: 12170 [2018-11-28 12:27:55,103 INFO L631 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-28 12:27:55,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2018-11-28 12:27:55,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11144. [2018-11-28 12:27:55,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2018-11-28 12:27:55,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 13702 transitions. [2018-11-28 12:27:55,285 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 13702 transitions. Word has length 28 [2018-11-28 12:27:55,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:55,285 INFO L480 AbstractCegarLoop]: Abstraction has 11144 states and 13702 transitions. [2018-11-28 12:27:55,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:55,285 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 13702 transitions. [2018-11-28 12:27:55,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 12:27:55,298 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:55,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:27:55,299 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:55,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:55,299 INFO L82 PathProgramCache]: Analyzing trace with hash 128195115, now seen corresponding path program 1 times [2018-11-28 12:27:55,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:55,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:55,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:55,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:55,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:55,317 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-28 12:27:55,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:55,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:55,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:55,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:55,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:55,318 INFO L87 Difference]: Start difference. First operand 11144 states and 13702 transitions. Second operand 3 states. [2018-11-28 12:27:55,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:55,457 INFO L93 Difference]: Finished difference Result 25228 states and 30856 transitions. [2018-11-28 12:27:55,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:55,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 12:27:55,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:55,469 INFO L225 Difference]: With dead ends: 25228 [2018-11-28 12:27:55,469 INFO L226 Difference]: Without dead ends: 14218 [2018-11-28 12:27:55,479 INFO L631 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-28 12:27:55,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2018-11-28 12:27:55,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 14216. [2018-11-28 12:27:55,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2018-11-28 12:27:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 16902 transitions. [2018-11-28 12:27:55,804 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 16902 transitions. Word has length 28 [2018-11-28 12:27:55,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:55,805 INFO L480 AbstractCegarLoop]: Abstraction has 14216 states and 16902 transitions. [2018-11-28 12:27:55,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:55,805 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 16902 transitions. [2018-11-28 12:27:55,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 12:27:55,815 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:55,815 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:27:55,815 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:55,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:55,815 INFO L82 PathProgramCache]: Analyzing trace with hash 690414627, now seen corresponding path program 1 times [2018-11-28 12:27:55,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:55,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:55,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:55,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:55,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:55,839 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-28 12:27:55,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:55,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:55,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:55,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:55,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:55,840 INFO L87 Difference]: Start difference. First operand 14216 states and 16902 transitions. Second operand 3 states. [2018-11-28 12:27:56,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:56,020 INFO L93 Difference]: Finished difference Result 21516 states and 25608 transitions. [2018-11-28 12:27:56,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:56,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 12:27:56,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:56,030 INFO L225 Difference]: With dead ends: 21516 [2018-11-28 12:27:56,030 INFO L226 Difference]: Without dead ends: 14602 [2018-11-28 12:27:56,039 INFO L631 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-28 12:27:56,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2018-11-28 12:27:56,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 14600. [2018-11-28 12:27:56,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2018-11-28 12:27:56,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 17158 transitions. [2018-11-28 12:27:56,233 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 17158 transitions. Word has length 29 [2018-11-28 12:27:56,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:56,233 INFO L480 AbstractCegarLoop]: Abstraction has 14600 states and 17158 transitions. [2018-11-28 12:27:56,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:56,234 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 17158 transitions. [2018-11-28 12:27:56,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 12:27:56,240 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:56,240 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:27:56,240 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:56,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:56,240 INFO L82 PathProgramCache]: Analyzing trace with hash -320702623, now seen corresponding path program 1 times [2018-11-28 12:27:56,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:56,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:56,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:56,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:56,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:56,257 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-28 12:27:56,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:56,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:56,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:56,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:56,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:56,258 INFO L87 Difference]: Start difference. First operand 14600 states and 17158 transitions. Second operand 3 states. [2018-11-28 12:27:56,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:56,514 INFO L93 Difference]: Finished difference Result 23562 states and 27399 transitions. [2018-11-28 12:27:56,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:56,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 12:27:56,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:56,527 INFO L225 Difference]: With dead ends: 23562 [2018-11-28 12:27:56,527 INFO L226 Difference]: Without dead ends: 23560 [2018-11-28 12:27:56,529 INFO L631 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-28 12:27:56,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23560 states. [2018-11-28 12:27:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23560 to 22536. [2018-11-28 12:27:56,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22536 states. [2018-11-28 12:27:56,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22536 states to 22536 states and 25862 transitions. [2018-11-28 12:27:56,761 INFO L78 Accepts]: Start accepts. Automaton has 22536 states and 25862 transitions. Word has length 29 [2018-11-28 12:27:56,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:56,761 INFO L480 AbstractCegarLoop]: Abstraction has 22536 states and 25862 transitions. [2018-11-28 12:27:56,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:56,761 INFO L276 IsEmpty]: Start isEmpty. Operand 22536 states and 25862 transitions. [2018-11-28 12:27:56,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 12:27:56,773 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:56,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:27:56,773 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:56,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:56,773 INFO L82 PathProgramCache]: Analyzing trace with hash -907508637, now seen corresponding path program 1 times [2018-11-28 12:27:56,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:56,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:56,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:56,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:56,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:56,789 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-28 12:27:56,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:56,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:56,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:56,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:56,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:56,790 INFO L87 Difference]: Start difference. First operand 22536 states and 25862 transitions. Second operand 3 states. [2018-11-28 12:27:57,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:57,070 INFO L93 Difference]: Finished difference Result 50184 states and 56582 transitions. [2018-11-28 12:27:57,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:57,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 12:27:57,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:57,071 INFO L225 Difference]: With dead ends: 50184 [2018-11-28 12:27:57,071 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 12:27:57,104 INFO L631 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-28 12:27:57,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 12:27:57,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 12:27:57,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 12:27:57,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 12:27:57,105 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-11-28 12:27:57,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:57,105 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:27:57,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:57,105 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:27:57,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 12:27:57,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 12:27:57,138 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 12:27:57,139 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 12:27:57,139 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 12:27:57,139 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 12:27:57,139 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 12:27:57,139 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 12:27:57,139 INFO L451 ceAbstractionStarter]: At program point L159(lines 5 163) the Hoare annotation is: true [2018-11-28 12:27:57,139 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 163) no Hoare annotation was computed. [2018-11-28 12:27:57,139 INFO L448 ceAbstractionStarter]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 12:27:57,139 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 12:27:57,139 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 12:27:57,142 INFO L448 ceAbstractionStarter]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 12:27:57,143 INFO L448 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2018-11-28 12:27:57,143 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 12:27:57,143 INFO L448 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-11-28 12:27:57,143 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 12:27:57,143 INFO L448 ceAbstractionStarter]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 12:27:57,143 INFO L448 ceAbstractionStarter]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 12:27:57,143 INFO L451 ceAbstractionStarter]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2018-11-28 12:27:57,143 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 163) no Hoare annotation was computed. [2018-11-28 12:27:57,143 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2018-11-28 12:27:57,143 INFO L448 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-11-28 12:27:57,144 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 163) the Hoare annotation is: true [2018-11-28 12:27:57,144 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-28 12:27:57,144 INFO L444 ceAbstractionStarter]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2018-11-28 12:27:57,144 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 12:27:57,144 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 12:27:57,144 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-11-28 12:27:57,144 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-28 12:27:57,144 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 12:27:57,144 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 12:27:57,144 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 12:27:57,144 INFO L448 ceAbstractionStarter]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 12:27:57,144 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 12:27:57,144 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2018-11-28 12:27:57,144 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 12:27:57,145 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-11-28 12:27:57,145 INFO L448 ceAbstractionStarter]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2018-11-28 12:27:57,145 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-28 12:27:57,145 INFO L448 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2018-11-28 12:27:57,145 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 12:27:57,145 INFO L448 ceAbstractionStarter]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2018-11-28 12:27:57,145 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-28 12:27:57,145 INFO L448 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2018-11-28 12:27:57,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:27:57 BoogieIcfgContainer [2018-11-28 12:27:57,152 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 12:27:57,152 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:27:57,152 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:27:57,153 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:27:57,153 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:27:51" (3/4) ... [2018-11-28 12:27:57,156 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 12:27:57,163 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 12:27:57,164 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 12:27:57,168 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 12:27:57,169 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 12:27:57,169 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 12:27:57,215 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9a705622-69e5-4a50-b307-38115586d54f/bin-2019/uautomizer/witness.graphml [2018-11-28 12:27:57,215 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:27:57,216 INFO L168 Benchmark]: Toolchain (without parser) took 6007.60 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 547.9 MB). Free memory was 960.7 MB in the beginning and 1.0 GB in the end (delta: -66.2 MB). Peak memory consumption was 481.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:27:57,218 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:27:57,218 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.14 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 949.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:27:57,219 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.26 ms. Allocated memory is still 1.0 GB. Free memory was 949.9 MB in the beginning and 944.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:27:57,219 INFO L168 Benchmark]: Boogie Preprocessor took 60.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 944.6 MB in the beginning and 1.2 GB in the end (delta: -210.6 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-11-28 12:27:57,219 INFO L168 Benchmark]: RCFGBuilder took 275.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2018-11-28 12:27:57,219 INFO L168 Benchmark]: TraceAbstraction took 5444.48 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 388.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.4 MB). Peak memory consumption was 493.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:27:57,220 INFO L168 Benchmark]: Witness Printer took 62.76 ms. Allocated memory is still 1.6 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 11.5 GB. [2018-11-28 12:27:57,221 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 148.14 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 949.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.26 ms. Allocated memory is still 1.0 GB. Free memory was 949.9 MB in the beginning and 944.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 944.6 MB in the beginning and 1.2 GB in the end (delta: -210.6 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 275.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5444.48 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 388.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.4 MB). Peak memory consumption was 493.4 MB. Max. memory is 11.5 GB. * Witness Printer took 62.76 ms. Allocated memory is still 1.6 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 1 error locations. SAFE Result, 5.3s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2384 SDtfs, 1153 SDslu, 1624 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22536occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 1034 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 659 ConstructedInterpolants, 0 QuantifiedInterpolants, 31265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...