./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9eb39c4b-048b-4c49-a794-83364067e896/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9eb39c4b-048b-4c49-a794-83364067e896/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9eb39c4b-048b-4c49-a794-83364067e896/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9eb39c4b-048b-4c49-a794-83364067e896/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9eb39c4b-048b-4c49-a794-83364067e896/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9eb39c4b-048b-4c49-a794-83364067e896/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 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 14:12:15,511 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 14:12:15,512 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 14:12:15,520 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 14:12:15,520 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 14:12:15,520 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 14:12:15,521 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 14:12:15,522 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 14:12:15,523 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 14:12:15,523 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 14:12:15,524 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 14:12:15,524 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 14:12:15,525 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 14:12:15,525 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 14:12:15,526 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 14:12:15,526 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 14:12:15,527 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 14:12:15,527 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 14:12:15,529 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 14:12:15,529 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 14:12:15,530 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 14:12:15,530 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 14:12:15,531 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 14:12:15,531 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 14:12:15,532 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 14:12:15,532 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 14:12:15,532 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 14:12:15,533 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 14:12:15,533 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 14:12:15,534 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 14:12:15,534 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 14:12:15,534 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 14:12:15,534 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 14:12:15,534 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 14:12:15,535 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 14:12:15,535 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 14:12:15,535 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9eb39c4b-048b-4c49-a794-83364067e896/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-01 14:12:15,542 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 14:12:15,542 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 14:12:15,543 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 14:12:15,543 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 14:12:15,543 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 14:12:15,543 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 14:12:15,543 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 14:12:15,544 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 14:12:15,544 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 14:12:15,544 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 14:12:15,544 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 14:12:15,544 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 14:12:15,544 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 14:12:15,545 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 14:12:15,545 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 14:12:15,545 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 14:12:15,545 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 14:12:15,545 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 14:12:15,545 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 14:12:15,546 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 14:12:15,546 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 14:12:15,546 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 14:12:15,546 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 14:12:15,546 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 14:12:15,546 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 14:12:15,546 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 14:12:15,547 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 14:12:15,547 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 14:12:15,547 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 14:12:15,547 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 14:12:15,547 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_9eb39c4b-048b-4c49-a794-83364067e896/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 -> 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 [2018-12-01 14:12:15,571 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 14:12:15,580 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 14:12:15,582 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 14:12:15,583 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 14:12:15,584 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 14:12:15,584 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9eb39c4b-048b-4c49-a794-83364067e896/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-01 14:12:15,621 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9eb39c4b-048b-4c49-a794-83364067e896/bin-2019/uautomizer/data/080159628/00bbe4ab25804855a4811b613fefcee8/FLAG33423741e [2018-12-01 14:12:15,944 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 14:12:15,945 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9eb39c4b-048b-4c49-a794-83364067e896/sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-01 14:12:15,950 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9eb39c4b-048b-4c49-a794-83364067e896/bin-2019/uautomizer/data/080159628/00bbe4ab25804855a4811b613fefcee8/FLAG33423741e [2018-12-01 14:12:15,958 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9eb39c4b-048b-4c49-a794-83364067e896/bin-2019/uautomizer/data/080159628/00bbe4ab25804855a4811b613fefcee8 [2018-12-01 14:12:15,960 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 14:12:15,961 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 14:12:15,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 14:12:15,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 14:12:15,963 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 14:12:15,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 02:12:15" (1/1) ... [2018-12-01 14:12:15,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27d92faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:12:15, skipping insertion in model container [2018-12-01 14:12:15,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 02:12:15" (1/1) ... [2018-12-01 14:12:15,970 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 14:12:15,982 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 14:12:16,071 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 14:12:16,073 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 14:12:16,088 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 14:12:16,096 INFO L195 MainTranslator]: Completed translation [2018-12-01 14:12:16,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:12:16 WrapperNode [2018-12-01 14:12:16,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 14:12:16,097 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 14:12:16,097 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 14:12:16,097 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 14:12:16,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:12:16" (1/1) ... [2018-12-01 14:12:16,105 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:12:16" (1/1) ... [2018-12-01 14:12:16,108 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 14:12:16,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 14:12:16,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 14:12:16,109 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 14:12:16,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:12:16" (1/1) ... [2018-12-01 14:12:16,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:12:16" (1/1) ... [2018-12-01 14:12:16,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:12:16" (1/1) ... [2018-12-01 14:12:16,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:12:16" (1/1) ... [2018-12-01 14:12:16,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:12:16" (1/1) ... [2018-12-01 14:12:16,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:12:16" (1/1) ... [2018-12-01 14:12:16,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:12:16" (1/1) ... [2018-12-01 14:12:16,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 14:12:16,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 14:12:16,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 14:12:16,156 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 14:12:16,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:12:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9eb39c4b-048b-4c49-a794-83364067e896/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-12-01 14:12:16,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 14:12:16,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 14:12:16,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 14:12:16,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 14:12:16,189 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 14:12:16,189 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 14:12:16,361 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 14:12:16,361 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-01 14:12:16,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 02:12:16 BoogieIcfgContainer [2018-12-01 14:12:16,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 14:12:16,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 14:12:16,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 14:12:16,364 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 14:12:16,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 02:12:15" (1/3) ... [2018-12-01 14:12:16,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa381a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 02:12:16, skipping insertion in model container [2018-12-01 14:12:16,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:12:16" (2/3) ... [2018-12-01 14:12:16,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa381a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 02:12:16, skipping insertion in model container [2018-12-01 14:12:16,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 02:12:16" (3/3) ... [2018-12-01 14:12:16,366 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-01 14:12:16,372 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 14:12:16,376 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-01 14:12:16,386 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-01 14:12:16,407 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 14:12:16,407 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 14:12:16,407 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 14:12:16,407 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 14:12:16,408 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 14:12:16,408 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 14:12:16,408 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 14:12:16,408 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 14:12:16,408 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 14:12:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-12-01 14:12:16,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 14:12:16,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:16,424 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-12-01 14:12:16,425 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:16,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:16,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1339057171, now seen corresponding path program 1 times [2018-12-01 14:12:16,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:16,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:16,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:16,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:16,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:16,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:16,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:16,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:16,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:16,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:16,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:16,553 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-12-01 14:12:16,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:16,580 INFO L93 Difference]: Finished difference Result 99 states and 174 transitions. [2018-12-01 14:12:16,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:16,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-01 14:12:16,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:16,588 INFO L225 Difference]: With dead ends: 99 [2018-12-01 14:12:16,589 INFO L226 Difference]: Without dead ends: 84 [2018-12-01 14:12:16,590 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-12-01 14:12:16,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-01 14:12:16,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2018-12-01 14:12:16,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-01 14:12:16,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 105 transitions. [2018-12-01 14:12:16,615 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 105 transitions. Word has length 22 [2018-12-01 14:12:16,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:16,615 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 105 transitions. [2018-12-01 14:12:16,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:16,615 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 105 transitions. [2018-12-01 14:12:16,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 14:12:16,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:16,615 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-12-01 14:12:16,616 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:16,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:16,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1676046447, now seen corresponding path program 1 times [2018-12-01 14:12:16,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:16,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:16,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:16,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:16,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:16,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:16,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:16,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:16,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:16,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:16,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:16,651 INFO L87 Difference]: Start difference. First operand 58 states and 105 transitions. Second operand 3 states. [2018-12-01 14:12:16,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:16,676 INFO L93 Difference]: Finished difference Result 137 states and 252 transitions. [2018-12-01 14:12:16,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:16,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-01 14:12:16,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:16,678 INFO L225 Difference]: With dead ends: 137 [2018-12-01 14:12:16,678 INFO L226 Difference]: Without dead ends: 84 [2018-12-01 14:12:16,679 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-12-01 14:12:16,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-01 14:12:16,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-12-01 14:12:16,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-01 14:12:16,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 149 transitions. [2018-12-01 14:12:16,686 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 149 transitions. Word has length 22 [2018-12-01 14:12:16,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:16,686 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 149 transitions. [2018-12-01 14:12:16,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:16,686 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 149 transitions. [2018-12-01 14:12:16,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 14:12:16,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:16,687 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-12-01 14:12:16,687 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:16,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:16,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1439113391, now seen corresponding path program 1 times [2018-12-01 14:12:16,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:16,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:16,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:16,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:16,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:16,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:16,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:16,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:16,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:16,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:16,721 INFO L87 Difference]: Start difference. First operand 82 states and 149 transitions. Second operand 3 states. [2018-12-01 14:12:16,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:16,733 INFO L93 Difference]: Finished difference Result 126 states and 225 transitions. [2018-12-01 14:12:16,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:16,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-01 14:12:16,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:16,734 INFO L225 Difference]: With dead ends: 126 [2018-12-01 14:12:16,734 INFO L226 Difference]: Without dead ends: 87 [2018-12-01 14:12:16,735 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-12-01 14:12:16,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-01 14:12:16,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-12-01 14:12:16,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-01 14:12:16,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 151 transitions. [2018-12-01 14:12:16,739 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 151 transitions. Word has length 23 [2018-12-01 14:12:16,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:16,739 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 151 transitions. [2018-12-01 14:12:16,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:16,740 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2018-12-01 14:12:16,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 14:12:16,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:16,740 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-12-01 14:12:16,740 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:16,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:16,740 INFO L82 PathProgramCache]: Analyzing trace with hash 418045037, now seen corresponding path program 1 times [2018-12-01 14:12:16,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:16,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:16,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:16,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:16,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:16,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:16,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:16,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:16,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:16,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:16,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:16,765 INFO L87 Difference]: Start difference. First operand 85 states and 151 transitions. Second operand 3 states. [2018-12-01 14:12:16,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:16,781 INFO L93 Difference]: Finished difference Result 160 states and 288 transitions. [2018-12-01 14:12:16,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:16,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-01 14:12:16,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:16,782 INFO L225 Difference]: With dead ends: 160 [2018-12-01 14:12:16,782 INFO L226 Difference]: Without dead ends: 158 [2018-12-01 14:12:16,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-12-01 14:12:16,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-01 14:12:16,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2018-12-01 14:12:16,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-01 14:12:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 200 transitions. [2018-12-01 14:12:16,790 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 200 transitions. Word has length 23 [2018-12-01 14:12:16,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:16,790 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 200 transitions. [2018-12-01 14:12:16,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:16,790 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 200 transitions. [2018-12-01 14:12:16,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 14:12:16,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:16,791 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-12-01 14:12:16,791 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:16,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:16,791 INFO L82 PathProgramCache]: Analyzing trace with hash -861818641, now seen corresponding path program 1 times [2018-12-01 14:12:16,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:16,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:16,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:16,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:16,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:16,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:16,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:16,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:16,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:16,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:16,814 INFO L87 Difference]: Start difference. First operand 112 states and 200 transitions. Second operand 3 states. [2018-12-01 14:12:16,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:16,827 INFO L93 Difference]: Finished difference Result 264 states and 478 transitions. [2018-12-01 14:12:16,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:16,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-01 14:12:16,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:16,828 INFO L225 Difference]: With dead ends: 264 [2018-12-01 14:12:16,829 INFO L226 Difference]: Without dead ends: 160 [2018-12-01 14:12:16,829 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-12-01 14:12:16,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-01 14:12:16,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2018-12-01 14:12:16,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-01 14:12:16,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 282 transitions. [2018-12-01 14:12:16,838 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 282 transitions. Word has length 23 [2018-12-01 14:12:16,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:16,838 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 282 transitions. [2018-12-01 14:12:16,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:16,839 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 282 transitions. [2018-12-01 14:12:16,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-01 14:12:16,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:16,839 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-12-01 14:12:16,840 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:16,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:16,840 INFO L82 PathProgramCache]: Analyzing trace with hash 74707332, now seen corresponding path program 1 times [2018-12-01 14:12:16,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:16,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:16,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:16,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:16,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:16,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:16,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:16,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:16,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:16,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:16,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:16,858 INFO L87 Difference]: Start difference. First operand 158 states and 282 transitions. Second operand 3 states. [2018-12-01 14:12:16,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:16,870 INFO L93 Difference]: Finished difference Result 237 states and 421 transitions. [2018-12-01 14:12:16,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:16,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-01 14:12:16,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:16,872 INFO L225 Difference]: With dead ends: 237 [2018-12-01 14:12:16,872 INFO L226 Difference]: Without dead ends: 162 [2018-12-01 14:12:16,873 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-12-01 14:12:16,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-01 14:12:16,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-12-01 14:12:16,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-01 14:12:16,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 282 transitions. [2018-12-01 14:12:16,880 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 282 transitions. Word has length 24 [2018-12-01 14:12:16,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:16,881 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 282 transitions. [2018-12-01 14:12:16,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:16,881 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 282 transitions. [2018-12-01 14:12:16,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-01 14:12:16,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:16,882 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-12-01 14:12:16,882 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:16,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:16,882 INFO L82 PathProgramCache]: Analyzing trace with hash -946361022, now seen corresponding path program 1 times [2018-12-01 14:12:16,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:16,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:16,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:16,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:16,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:16,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:16,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:16,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:16,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:16,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:16,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:16,905 INFO L87 Difference]: Start difference. First operand 160 states and 282 transitions. Second operand 3 states. [2018-12-01 14:12:16,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:16,919 INFO L93 Difference]: Finished difference Result 300 states and 536 transitions. [2018-12-01 14:12:16,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:16,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-01 14:12:16,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:16,920 INFO L225 Difference]: With dead ends: 300 [2018-12-01 14:12:16,921 INFO L226 Difference]: Without dead ends: 298 [2018-12-01 14:12:16,921 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-12-01 14:12:16,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-12-01 14:12:16,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 216. [2018-12-01 14:12:16,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-12-01 14:12:16,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2018-12-01 14:12:16,929 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 24 [2018-12-01 14:12:16,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:16,929 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2018-12-01 14:12:16,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:16,929 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2018-12-01 14:12:16,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-01 14:12:16,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:16,931 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-12-01 14:12:16,931 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:16,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:16,931 INFO L82 PathProgramCache]: Analyzing trace with hash 2068742596, now seen corresponding path program 1 times [2018-12-01 14:12:16,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:16,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:16,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:16,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:16,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:16,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:16,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:16,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:16,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:16,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:16,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:16,952 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 3 states. [2018-12-01 14:12:16,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:16,966 INFO L93 Difference]: Finished difference Result 512 states and 904 transitions. [2018-12-01 14:12:16,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:16,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-01 14:12:16,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:16,967 INFO L225 Difference]: With dead ends: 512 [2018-12-01 14:12:16,968 INFO L226 Difference]: Without dead ends: 306 [2018-12-01 14:12:16,968 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-12-01 14:12:16,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-12-01 14:12:16,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2018-12-01 14:12:16,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-12-01 14:12:16,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 530 transitions. [2018-12-01 14:12:16,977 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 530 transitions. Word has length 24 [2018-12-01 14:12:16,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:16,977 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 530 transitions. [2018-12-01 14:12:16,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:16,978 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 530 transitions. [2018-12-01 14:12:16,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-01 14:12:16,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:16,979 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-12-01 14:12:16,979 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:16,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:16,979 INFO L82 PathProgramCache]: Analyzing trace with hash 727792804, now seen corresponding path program 1 times [2018-12-01 14:12:16,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:16,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:16,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:16,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:16,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:16,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:16,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:16,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:16,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:16,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:16,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:16,996 INFO L87 Difference]: Start difference. First operand 304 states and 530 transitions. Second operand 3 states. [2018-12-01 14:12:17,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:17,011 INFO L93 Difference]: Finished difference Result 456 states and 792 transitions. [2018-12-01 14:12:17,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:17,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-01 14:12:17,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:17,013 INFO L225 Difference]: With dead ends: 456 [2018-12-01 14:12:17,013 INFO L226 Difference]: Without dead ends: 310 [2018-12-01 14:12:17,013 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-12-01 14:12:17,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-01 14:12:17,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2018-12-01 14:12:17,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-12-01 14:12:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 530 transitions. [2018-12-01 14:12:17,022 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 530 transitions. Word has length 25 [2018-12-01 14:12:17,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:17,022 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 530 transitions. [2018-12-01 14:12:17,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:17,022 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 530 transitions. [2018-12-01 14:12:17,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-01 14:12:17,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:17,023 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-12-01 14:12:17,023 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:17,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:17,023 INFO L82 PathProgramCache]: Analyzing trace with hash -293275550, now seen corresponding path program 1 times [2018-12-01 14:12:17,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:17,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:17,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:17,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:17,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:17,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:17,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:17,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:17,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:17,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:17,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:17,044 INFO L87 Difference]: Start difference. First operand 308 states and 530 transitions. Second operand 3 states. [2018-12-01 14:12:17,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:17,063 INFO L93 Difference]: Finished difference Result 572 states and 1000 transitions. [2018-12-01 14:12:17,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:17,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-01 14:12:17,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:17,066 INFO L225 Difference]: With dead ends: 572 [2018-12-01 14:12:17,066 INFO L226 Difference]: Without dead ends: 570 [2018-12-01 14:12:17,066 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-12-01 14:12:17,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-12-01 14:12:17,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 424. [2018-12-01 14:12:17,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-12-01 14:12:17,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 718 transitions. [2018-12-01 14:12:17,080 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 718 transitions. Word has length 25 [2018-12-01 14:12:17,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:17,080 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 718 transitions. [2018-12-01 14:12:17,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 718 transitions. [2018-12-01 14:12:17,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-01 14:12:17,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:17,082 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-12-01 14:12:17,082 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:17,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:17,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1573139228, now seen corresponding path program 1 times [2018-12-01 14:12:17,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:17,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:17,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:17,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:17,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:17,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:17,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:17,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:17,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:17,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:17,099 INFO L87 Difference]: Start difference. First operand 424 states and 718 transitions. Second operand 3 states. [2018-12-01 14:12:17,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:17,121 INFO L93 Difference]: Finished difference Result 1004 states and 1712 transitions. [2018-12-01 14:12:17,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:17,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-01 14:12:17,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:17,124 INFO L225 Difference]: With dead ends: 1004 [2018-12-01 14:12:17,124 INFO L226 Difference]: Without dead ends: 594 [2018-12-01 14:12:17,125 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-12-01 14:12:17,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-12-01 14:12:17,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 592. [2018-12-01 14:12:17,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-12-01 14:12:17,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 998 transitions. [2018-12-01 14:12:17,143 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 998 transitions. Word has length 25 [2018-12-01 14:12:17,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:17,143 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 998 transitions. [2018-12-01 14:12:17,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:17,143 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 998 transitions. [2018-12-01 14:12:17,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-01 14:12:17,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:17,144 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-12-01 14:12:17,144 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:17,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:17,145 INFO L82 PathProgramCache]: Analyzing trace with hash -501393703, now seen corresponding path program 1 times [2018-12-01 14:12:17,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:17,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:17,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:17,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:17,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:17,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:17,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:17,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:17,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:17,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:17,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:17,165 INFO L87 Difference]: Start difference. First operand 592 states and 998 transitions. Second operand 3 states. [2018-12-01 14:12:17,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:17,183 INFO L93 Difference]: Finished difference Result 888 states and 1492 transitions. [2018-12-01 14:12:17,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:17,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-01 14:12:17,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:17,185 INFO L225 Difference]: With dead ends: 888 [2018-12-01 14:12:17,186 INFO L226 Difference]: Without dead ends: 602 [2018-12-01 14:12:17,186 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-12-01 14:12:17,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-12-01 14:12:17,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2018-12-01 14:12:17,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-12-01 14:12:17,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 998 transitions. [2018-12-01 14:12:17,203 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 998 transitions. Word has length 26 [2018-12-01 14:12:17,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:17,204 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 998 transitions. [2018-12-01 14:12:17,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:17,204 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 998 transitions. [2018-12-01 14:12:17,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-01 14:12:17,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:17,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, 1, 1, 1, 1, 1] [2018-12-01 14:12:17,205 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:17,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:17,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1522462057, now seen corresponding path program 1 times [2018-12-01 14:12:17,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:17,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:17,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:17,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:17,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:17,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:17,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:17,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:17,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:17,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:17,222 INFO L87 Difference]: Start difference. First operand 600 states and 998 transitions. Second operand 3 states. [2018-12-01 14:12:17,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:17,244 INFO L93 Difference]: Finished difference Result 1100 states and 1864 transitions. [2018-12-01 14:12:17,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:17,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-01 14:12:17,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:17,248 INFO L225 Difference]: With dead ends: 1100 [2018-12-01 14:12:17,248 INFO L226 Difference]: Without dead ends: 1098 [2018-12-01 14:12:17,248 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-12-01 14:12:17,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2018-12-01 14:12:17,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 840. [2018-12-01 14:12:17,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2018-12-01 14:12:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1366 transitions. [2018-12-01 14:12:17,273 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1366 transitions. Word has length 26 [2018-12-01 14:12:17,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:17,273 INFO L480 AbstractCegarLoop]: Abstraction has 840 states and 1366 transitions. [2018-12-01 14:12:17,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:17,274 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1366 transitions. [2018-12-01 14:12:17,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-01 14:12:17,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:17,275 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-12-01 14:12:17,275 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:17,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:17,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1492641561, now seen corresponding path program 1 times [2018-12-01 14:12:17,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:17,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:17,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:17,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:17,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:17,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:17,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:17,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:17,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:17,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:17,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:17,290 INFO L87 Difference]: Start difference. First operand 840 states and 1366 transitions. Second operand 3 states. [2018-12-01 14:12:17,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:17,317 INFO L93 Difference]: Finished difference Result 1980 states and 3240 transitions. [2018-12-01 14:12:17,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:17,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-01 14:12:17,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:17,321 INFO L225 Difference]: With dead ends: 1980 [2018-12-01 14:12:17,321 INFO L226 Difference]: Without dead ends: 1162 [2018-12-01 14:12:17,323 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-12-01 14:12:17,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2018-12-01 14:12:17,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1160. [2018-12-01 14:12:17,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2018-12-01 14:12:17,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1878 transitions. [2018-12-01 14:12:17,349 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1878 transitions. Word has length 26 [2018-12-01 14:12:17,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:17,350 INFO L480 AbstractCegarLoop]: Abstraction has 1160 states and 1878 transitions. [2018-12-01 14:12:17,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:17,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1878 transitions. [2018-12-01 14:12:17,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 14:12:17,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:17,351 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-12-01 14:12:17,351 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:17,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:17,352 INFO L82 PathProgramCache]: Analyzing trace with hash 48530585, now seen corresponding path program 1 times [2018-12-01 14:12:17,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:17,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:17,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:17,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:17,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:17,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:17,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:17,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:17,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:17,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:17,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:17,369 INFO L87 Difference]: Start difference. First operand 1160 states and 1878 transitions. Second operand 3 states. [2018-12-01 14:12:17,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:17,396 INFO L93 Difference]: Finished difference Result 1740 states and 2808 transitions. [2018-12-01 14:12:17,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:17,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-01 14:12:17,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:17,400 INFO L225 Difference]: With dead ends: 1740 [2018-12-01 14:12:17,400 INFO L226 Difference]: Without dead ends: 1178 [2018-12-01 14:12:17,402 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-12-01 14:12:17,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2018-12-01 14:12:17,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1176. [2018-12-01 14:12:17,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-12-01 14:12:17,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1878 transitions. [2018-12-01 14:12:17,435 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1878 transitions. Word has length 27 [2018-12-01 14:12:17,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:17,435 INFO L480 AbstractCegarLoop]: Abstraction has 1176 states and 1878 transitions. [2018-12-01 14:12:17,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:17,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1878 transitions. [2018-12-01 14:12:17,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 14:12:17,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:17,437 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-12-01 14:12:17,437 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:17,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:17,437 INFO L82 PathProgramCache]: Analyzing trace with hash -972537769, now seen corresponding path program 1 times [2018-12-01 14:12:17,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:17,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:17,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:17,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:17,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:17,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:17,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:17,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:17,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:17,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:17,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:17,454 INFO L87 Difference]: Start difference. First operand 1176 states and 1878 transitions. Second operand 3 states. [2018-12-01 14:12:17,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:17,491 INFO L93 Difference]: Finished difference Result 2124 states and 3464 transitions. [2018-12-01 14:12:17,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:17,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-01 14:12:17,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:17,495 INFO L225 Difference]: With dead ends: 2124 [2018-12-01 14:12:17,495 INFO L226 Difference]: Without dead ends: 2122 [2018-12-01 14:12:17,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-12-01 14:12:17,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2018-12-01 14:12:17,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1672. [2018-12-01 14:12:17,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-12-01 14:12:17,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2598 transitions. [2018-12-01 14:12:17,545 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2598 transitions. Word has length 27 [2018-12-01 14:12:17,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:17,545 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 2598 transitions. [2018-12-01 14:12:17,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:17,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2598 transitions. [2018-12-01 14:12:17,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 14:12:17,547 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:17,547 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-12-01 14:12:17,548 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:17,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:17,548 INFO L82 PathProgramCache]: Analyzing trace with hash 2042565849, now seen corresponding path program 1 times [2018-12-01 14:12:17,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:17,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:17,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:17,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:17,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:17,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:17,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:17,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:17,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:17,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:17,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:17,561 INFO L87 Difference]: Start difference. First operand 1672 states and 2598 transitions. Second operand 3 states. [2018-12-01 14:12:17,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:17,592 INFO L93 Difference]: Finished difference Result 3916 states and 6120 transitions. [2018-12-01 14:12:17,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:17,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-01 14:12:17,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:17,596 INFO L225 Difference]: With dead ends: 3916 [2018-12-01 14:12:17,596 INFO L226 Difference]: Without dead ends: 2282 [2018-12-01 14:12:17,598 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-12-01 14:12:17,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2018-12-01 14:12:17,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2280. [2018-12-01 14:12:17,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2018-12-01 14:12:17,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3526 transitions. [2018-12-01 14:12:17,636 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3526 transitions. Word has length 27 [2018-12-01 14:12:17,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:17,636 INFO L480 AbstractCegarLoop]: Abstraction has 2280 states and 3526 transitions. [2018-12-01 14:12:17,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:17,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3526 transitions. [2018-12-01 14:12:17,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-01 14:12:17,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:17,638 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-12-01 14:12:17,638 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:17,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:17,638 INFO L82 PathProgramCache]: Analyzing trace with hash -83685330, now seen corresponding path program 1 times [2018-12-01 14:12:17,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:17,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:17,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:17,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:17,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:17,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:17,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:17,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:17,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:17,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:17,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:17,647 INFO L87 Difference]: Start difference. First operand 2280 states and 3526 transitions. Second operand 3 states. [2018-12-01 14:12:17,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:17,676 INFO L93 Difference]: Finished difference Result 3420 states and 5272 transitions. [2018-12-01 14:12:17,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:17,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-01 14:12:17,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:17,682 INFO L225 Difference]: With dead ends: 3420 [2018-12-01 14:12:17,682 INFO L226 Difference]: Without dead ends: 2314 [2018-12-01 14:12:17,684 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-12-01 14:12:17,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2018-12-01 14:12:17,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2312. [2018-12-01 14:12:17,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2018-12-01 14:12:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3526 transitions. [2018-12-01 14:12:17,730 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3526 transitions. Word has length 28 [2018-12-01 14:12:17,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:17,730 INFO L480 AbstractCegarLoop]: Abstraction has 2312 states and 3526 transitions. [2018-12-01 14:12:17,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:17,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3526 transitions. [2018-12-01 14:12:17,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-01 14:12:17,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:17,732 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-12-01 14:12:17,732 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:17,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:17,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1104753684, now seen corresponding path program 1 times [2018-12-01 14:12:17,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:17,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:17,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:17,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:17,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:17,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:17,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:17,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:17,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:17,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:17,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:17,743 INFO L87 Difference]: Start difference. First operand 2312 states and 3526 transitions. Second operand 3 states. [2018-12-01 14:12:17,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:17,783 INFO L93 Difference]: Finished difference Result 4108 states and 6408 transitions. [2018-12-01 14:12:17,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:17,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-01 14:12:17,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:17,790 INFO L225 Difference]: With dead ends: 4108 [2018-12-01 14:12:17,790 INFO L226 Difference]: Without dead ends: 4106 [2018-12-01 14:12:17,791 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-12-01 14:12:17,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2018-12-01 14:12:17,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 3336. [2018-12-01 14:12:17,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2018-12-01 14:12:17,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4934 transitions. [2018-12-01 14:12:17,841 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4934 transitions. Word has length 28 [2018-12-01 14:12:17,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:17,841 INFO L480 AbstractCegarLoop]: Abstraction has 3336 states and 4934 transitions. [2018-12-01 14:12:17,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:17,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4934 transitions. [2018-12-01 14:12:17,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-01 14:12:17,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:17,844 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-12-01 14:12:17,844 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:17,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:17,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1910349934, now seen corresponding path program 1 times [2018-12-01 14:12:17,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:17,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:17,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:17,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:17,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:17,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:17,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:17,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:17,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:17,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:17,853 INFO L87 Difference]: Start difference. First operand 3336 states and 4934 transitions. Second operand 3 states. [2018-12-01 14:12:17,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:17,900 INFO L93 Difference]: Finished difference Result 7756 states and 11528 transitions. [2018-12-01 14:12:17,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:17,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-01 14:12:17,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:17,907 INFO L225 Difference]: With dead ends: 7756 [2018-12-01 14:12:17,907 INFO L226 Difference]: Without dead ends: 4490 [2018-12-01 14:12:17,910 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-12-01 14:12:17,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2018-12-01 14:12:17,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 4488. [2018-12-01 14:12:17,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4488 states. [2018-12-01 14:12:17,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4488 states to 4488 states and 6598 transitions. [2018-12-01 14:12:17,979 INFO L78 Accepts]: Start accepts. Automaton has 4488 states and 6598 transitions. Word has length 28 [2018-12-01 14:12:17,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:17,979 INFO L480 AbstractCegarLoop]: Abstraction has 4488 states and 6598 transitions. [2018-12-01 14:12:17,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:17,979 INFO L276 IsEmpty]: Start isEmpty. Operand 4488 states and 6598 transitions. [2018-12-01 14:12:17,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-01 14:12:17,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:17,982 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-12-01 14:12:17,982 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:17,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:17,982 INFO L82 PathProgramCache]: Analyzing trace with hash 112588942, now seen corresponding path program 1 times [2018-12-01 14:12:17,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:17,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:17,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:17,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:17,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:17,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:17,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:17,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:17,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:17,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:17,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:17,991 INFO L87 Difference]: Start difference. First operand 4488 states and 6598 transitions. Second operand 3 states. [2018-12-01 14:12:18,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:18,065 INFO L93 Difference]: Finished difference Result 6732 states and 9864 transitions. [2018-12-01 14:12:18,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:18,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-01 14:12:18,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:18,076 INFO L225 Difference]: With dead ends: 6732 [2018-12-01 14:12:18,076 INFO L226 Difference]: Without dead ends: 4554 [2018-12-01 14:12:18,080 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-12-01 14:12:18,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states. [2018-12-01 14:12:18,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 4552. [2018-12-01 14:12:18,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4552 states. [2018-12-01 14:12:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 6598 transitions. [2018-12-01 14:12:18,150 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 6598 transitions. Word has length 29 [2018-12-01 14:12:18,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:18,150 INFO L480 AbstractCegarLoop]: Abstraction has 4552 states and 6598 transitions. [2018-12-01 14:12:18,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:18,150 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 6598 transitions. [2018-12-01 14:12:18,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-01 14:12:18,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:18,153 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-12-01 14:12:18,153 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:18,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:18,153 INFO L82 PathProgramCache]: Analyzing trace with hash -908479412, now seen corresponding path program 1 times [2018-12-01 14:12:18,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:18,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:18,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:18,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:18,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:18,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:18,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:18,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:18,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:18,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:18,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:18,163 INFO L87 Difference]: Start difference. First operand 4552 states and 6598 transitions. Second operand 3 states. [2018-12-01 14:12:18,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:18,239 INFO L93 Difference]: Finished difference Result 13260 states and 19016 transitions. [2018-12-01 14:12:18,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:18,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-01 14:12:18,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:18,252 INFO L225 Difference]: With dead ends: 13260 [2018-12-01 14:12:18,252 INFO L226 Difference]: Without dead ends: 8842 [2018-12-01 14:12:18,258 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-12-01 14:12:18,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8842 states. [2018-12-01 14:12:18,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8842 to 8840. [2018-12-01 14:12:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2018-12-01 14:12:18,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12422 transitions. [2018-12-01 14:12:18,373 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12422 transitions. Word has length 29 [2018-12-01 14:12:18,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:18,374 INFO L480 AbstractCegarLoop]: Abstraction has 8840 states and 12422 transitions. [2018-12-01 14:12:18,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:18,374 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12422 transitions. [2018-12-01 14:12:18,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-01 14:12:18,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:18,378 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-12-01 14:12:18,378 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:18,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:18,379 INFO L82 PathProgramCache]: Analyzing trace with hash 371384266, now seen corresponding path program 1 times [2018-12-01 14:12:18,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:18,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:18,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:18,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:18,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:18,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:18,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:18,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:18,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:18,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:18,391 INFO L87 Difference]: Start difference. First operand 8840 states and 12422 transitions. Second operand 3 states. [2018-12-01 14:12:18,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:18,475 INFO L93 Difference]: Finished difference Result 10124 states and 14728 transitions. [2018-12-01 14:12:18,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:18,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-01 14:12:18,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:18,487 INFO L225 Difference]: With dead ends: 10124 [2018-12-01 14:12:18,487 INFO L226 Difference]: Without dead ends: 10122 [2018-12-01 14:12:18,489 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-12-01 14:12:18,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10122 states. [2018-12-01 14:12:18,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10122 to 8840. [2018-12-01 14:12:18,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2018-12-01 14:12:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12294 transitions. [2018-12-01 14:12:18,618 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12294 transitions. Word has length 29 [2018-12-01 14:12:18,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:18,619 INFO L480 AbstractCegarLoop]: Abstraction has 8840 states and 12294 transitions. [2018-12-01 14:12:18,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:18,619 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12294 transitions. [2018-12-01 14:12:18,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-01 14:12:18,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:18,623 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, 1] [2018-12-01 14:12:18,624 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:18,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:18,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1902124419, now seen corresponding path program 1 times [2018-12-01 14:12:18,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:18,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:18,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:18,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:18,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:18,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:18,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:18,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:18,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:18,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:18,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:18,633 INFO L87 Difference]: Start difference. First operand 8840 states and 12294 transitions. Second operand 3 states. [2018-12-01 14:12:18,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:18,735 INFO L93 Difference]: Finished difference Result 15244 states and 21640 transitions. [2018-12-01 14:12:18,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:18,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-01 14:12:18,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:18,750 INFO L225 Difference]: With dead ends: 15244 [2018-12-01 14:12:18,751 INFO L226 Difference]: Without dead ends: 15242 [2018-12-01 14:12:18,753 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-12-01 14:12:18,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15242 states. [2018-12-01 14:12:18,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15242 to 13192. [2018-12-01 14:12:18,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13192 states. [2018-12-01 14:12:18,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13192 states to 13192 states and 17798 transitions. [2018-12-01 14:12:18,897 INFO L78 Accepts]: Start accepts. Automaton has 13192 states and 17798 transitions. Word has length 30 [2018-12-01 14:12:18,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:18,897 INFO L480 AbstractCegarLoop]: Abstraction has 13192 states and 17798 transitions. [2018-12-01 14:12:18,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:18,897 INFO L276 IsEmpty]: Start isEmpty. Operand 13192 states and 17798 transitions. [2018-12-01 14:12:18,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-01 14:12:18,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:18,904 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, 1] [2018-12-01 14:12:18,904 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:18,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:18,904 INFO L82 PathProgramCache]: Analyzing trace with hash 622260741, now seen corresponding path program 1 times [2018-12-01 14:12:18,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:18,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:18,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:18,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:18,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:18,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:18,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:18,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:18,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:18,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:18,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:18,913 INFO L87 Difference]: Start difference. First operand 13192 states and 17798 transitions. Second operand 3 states. [2018-12-01 14:12:19,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:19,056 INFO L93 Difference]: Finished difference Result 30348 states and 41096 transitions. [2018-12-01 14:12:19,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:19,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-01 14:12:19,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:19,070 INFO L225 Difference]: With dead ends: 30348 [2018-12-01 14:12:19,070 INFO L226 Difference]: Without dead ends: 17290 [2018-12-01 14:12:19,079 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-12-01 14:12:19,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17290 states. [2018-12-01 14:12:19,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17290 to 17288. [2018-12-01 14:12:19,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17288 states. [2018-12-01 14:12:19,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17288 states to 17288 states and 23046 transitions. [2018-12-01 14:12:19,274 INFO L78 Accepts]: Start accepts. Automaton has 17288 states and 23046 transitions. Word has length 30 [2018-12-01 14:12:19,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:19,274 INFO L480 AbstractCegarLoop]: Abstraction has 17288 states and 23046 transitions. [2018-12-01 14:12:19,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:19,274 INFO L276 IsEmpty]: Start isEmpty. Operand 17288 states and 23046 transitions. [2018-12-01 14:12:19,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-01 14:12:19,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:19,280 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, 1, 1] [2018-12-01 14:12:19,280 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:19,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:19,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1163469695, now seen corresponding path program 1 times [2018-12-01 14:12:19,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:19,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:19,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:19,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:19,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:19,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:19,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:19,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:19,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:19,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:19,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:19,301 INFO L87 Difference]: Start difference. First operand 17288 states and 23046 transitions. Second operand 3 states. [2018-12-01 14:12:19,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:19,435 INFO L93 Difference]: Finished difference Result 26124 states and 34824 transitions. [2018-12-01 14:12:19,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:19,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-01 14:12:19,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:19,449 INFO L225 Difference]: With dead ends: 26124 [2018-12-01 14:12:19,449 INFO L226 Difference]: Without dead ends: 17674 [2018-12-01 14:12:19,457 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-12-01 14:12:19,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17674 states. [2018-12-01 14:12:19,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17674 to 17672. [2018-12-01 14:12:19,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17672 states. [2018-12-01 14:12:19,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17672 states to 17672 states and 23302 transitions. [2018-12-01 14:12:19,695 INFO L78 Accepts]: Start accepts. Automaton has 17672 states and 23302 transitions. Word has length 31 [2018-12-01 14:12:19,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:19,696 INFO L480 AbstractCegarLoop]: Abstraction has 17672 states and 23302 transitions. [2018-12-01 14:12:19,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:19,696 INFO L276 IsEmpty]: Start isEmpty. Operand 17672 states and 23302 transitions. [2018-12-01 14:12:19,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-01 14:12:19,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:19,701 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, 1, 1] [2018-12-01 14:12:19,701 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:19,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:19,701 INFO L82 PathProgramCache]: Analyzing trace with hash 2110429247, now seen corresponding path program 1 times [2018-12-01 14:12:19,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:19,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:19,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:19,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:19,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:19,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:19,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:19,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:19,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:19,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:19,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:19,712 INFO L87 Difference]: Start difference. First operand 17672 states and 23302 transitions. Second operand 3 states. [2018-12-01 14:12:19,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:19,918 INFO L93 Difference]: Finished difference Result 29708 states and 39688 transitions. [2018-12-01 14:12:19,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:19,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-01 14:12:19,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:19,936 INFO L225 Difference]: With dead ends: 29708 [2018-12-01 14:12:19,936 INFO L226 Difference]: Without dead ends: 29706 [2018-12-01 14:12:19,941 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-12-01 14:12:19,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29706 states. [2018-12-01 14:12:20,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29706 to 26632. [2018-12-01 14:12:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26632 states. [2018-12-01 14:12:20,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26632 states to 26632 states and 34054 transitions. [2018-12-01 14:12:20,225 INFO L78 Accepts]: Start accepts. Automaton has 26632 states and 34054 transitions. Word has length 31 [2018-12-01 14:12:20,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:20,225 INFO L480 AbstractCegarLoop]: Abstraction has 26632 states and 34054 transitions. [2018-12-01 14:12:20,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:20,225 INFO L276 IsEmpty]: Start isEmpty. Operand 26632 states and 34054 transitions. [2018-12-01 14:12:20,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-01 14:12:20,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:20,236 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, 1, 1] [2018-12-01 14:12:20,236 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:20,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:20,236 INFO L82 PathProgramCache]: Analyzing trace with hash 830565569, now seen corresponding path program 1 times [2018-12-01 14:12:20,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:20,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:20,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:20,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:20,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:20,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:20,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:20,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:20,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:20,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:20,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:20,264 INFO L87 Difference]: Start difference. First operand 26632 states and 34054 transitions. Second operand 3 states. [2018-12-01 14:12:20,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:20,559 INFO L93 Difference]: Finished difference Result 60428 states and 77064 transitions. [2018-12-01 14:12:20,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:20,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-01 14:12:20,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:20,580 INFO L225 Difference]: With dead ends: 60428 [2018-12-01 14:12:20,580 INFO L226 Difference]: Without dead ends: 34314 [2018-12-01 14:12:20,599 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-12-01 14:12:20,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34314 states. [2018-12-01 14:12:21,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34314 to 34312. [2018-12-01 14:12:21,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34312 states. [2018-12-01 14:12:21,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34312 states to 34312 states and 43014 transitions. [2018-12-01 14:12:21,090 INFO L78 Accepts]: Start accepts. Automaton has 34312 states and 43014 transitions. Word has length 31 [2018-12-01 14:12:21,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:21,090 INFO L480 AbstractCegarLoop]: Abstraction has 34312 states and 43014 transitions. [2018-12-01 14:12:21,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:21,090 INFO L276 IsEmpty]: Start isEmpty. Operand 34312 states and 43014 transitions. [2018-12-01 14:12:21,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-01 14:12:21,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:21,099 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, 1, 1, 1] [2018-12-01 14:12:21,099 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:21,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:21,099 INFO L82 PathProgramCache]: Analyzing trace with hash 999013018, now seen corresponding path program 1 times [2018-12-01 14:12:21,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:21,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:21,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:21,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:21,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:21,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:21,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:21,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:21,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:21,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:21,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:21,121 INFO L87 Difference]: Start difference. First operand 34312 states and 43014 transitions. Second operand 3 states. [2018-12-01 14:12:21,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:21,386 INFO L93 Difference]: Finished difference Result 51468 states and 64264 transitions. [2018-12-01 14:12:21,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:21,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-01 14:12:21,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:21,409 INFO L225 Difference]: With dead ends: 51468 [2018-12-01 14:12:21,409 INFO L226 Difference]: Without dead ends: 34826 [2018-12-01 14:12:21,423 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-12-01 14:12:21,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34826 states. [2018-12-01 14:12:21,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34826 to 34824. [2018-12-01 14:12:21,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34824 states. [2018-12-01 14:12:21,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34824 states to 34824 states and 43014 transitions. [2018-12-01 14:12:21,878 INFO L78 Accepts]: Start accepts. Automaton has 34824 states and 43014 transitions. Word has length 32 [2018-12-01 14:12:21,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:21,878 INFO L480 AbstractCegarLoop]: Abstraction has 34824 states and 43014 transitions. [2018-12-01 14:12:21,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:21,878 INFO L276 IsEmpty]: Start isEmpty. Operand 34824 states and 43014 transitions. [2018-12-01 14:12:21,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-01 14:12:21,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:21,887 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, 1, 1, 1] [2018-12-01 14:12:21,887 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:21,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:21,887 INFO L82 PathProgramCache]: Analyzing trace with hash -22055336, now seen corresponding path program 1 times [2018-12-01 14:12:21,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:21,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:21,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:21,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:21,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:21,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:21,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:21,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:21,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:21,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:21,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:21,908 INFO L87 Difference]: Start difference. First operand 34824 states and 43014 transitions. Second operand 3 states. [2018-12-01 14:12:22,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:22,342 INFO L93 Difference]: Finished difference Result 57356 states and 71176 transitions. [2018-12-01 14:12:22,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:22,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-01 14:12:22,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:22,380 INFO L225 Difference]: With dead ends: 57356 [2018-12-01 14:12:22,380 INFO L226 Difference]: Without dead ends: 57354 [2018-12-01 14:12:22,389 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-12-01 14:12:22,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57354 states. [2018-12-01 14:12:22,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57354 to 53256. [2018-12-01 14:12:22,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53256 states. [2018-12-01 14:12:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53256 states to 53256 states and 64006 transitions. [2018-12-01 14:12:23,037 INFO L78 Accepts]: Start accepts. Automaton has 53256 states and 64006 transitions. Word has length 32 [2018-12-01 14:12:23,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:23,037 INFO L480 AbstractCegarLoop]: Abstraction has 53256 states and 64006 transitions. [2018-12-01 14:12:23,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:23,037 INFO L276 IsEmpty]: Start isEmpty. Operand 53256 states and 64006 transitions. [2018-12-01 14:12:23,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-01 14:12:23,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:23,063 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, 1, 1, 1] [2018-12-01 14:12:23,063 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:23,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:23,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1301919014, now seen corresponding path program 1 times [2018-12-01 14:12:23,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:23,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:23,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:23,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:23,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:23,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:23,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:23,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:23,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:23,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:23,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:23,084 INFO L87 Difference]: Start difference. First operand 53256 states and 64006 transitions. Second operand 3 states. [2018-12-01 14:12:23,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:23,648 INFO L93 Difference]: Finished difference Result 119820 states and 142856 transitions. [2018-12-01 14:12:23,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:23,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-01 14:12:23,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:23,693 INFO L225 Difference]: With dead ends: 119820 [2018-12-01 14:12:23,693 INFO L226 Difference]: Without dead ends: 67594 [2018-12-01 14:12:23,733 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-12-01 14:12:23,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67594 states. [2018-12-01 14:12:24,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67594 to 67592. [2018-12-01 14:12:24,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67592 states. [2018-12-01 14:12:24,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67592 states to 67592 states and 78854 transitions. [2018-12-01 14:12:24,681 INFO L78 Accepts]: Start accepts. Automaton has 67592 states and 78854 transitions. Word has length 32 [2018-12-01 14:12:24,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:24,681 INFO L480 AbstractCegarLoop]: Abstraction has 67592 states and 78854 transitions. [2018-12-01 14:12:24,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:24,681 INFO L276 IsEmpty]: Start isEmpty. Operand 67592 states and 78854 transitions. [2018-12-01 14:12:24,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-01 14:12:24,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:24,702 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, 1, 1, 1, 1] [2018-12-01 14:12:24,702 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:24,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:24,702 INFO L82 PathProgramCache]: Analyzing trace with hash -683499274, now seen corresponding path program 1 times [2018-12-01 14:12:24,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:24,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:24,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:24,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:24,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:24,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:24,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:24,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:24,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:24,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:24,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:24,714 INFO L87 Difference]: Start difference. First operand 67592 states and 78854 transitions. Second operand 3 states. [2018-12-01 14:12:25,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:25,412 INFO L93 Difference]: Finished difference Result 101388 states and 117768 transitions. [2018-12-01 14:12:25,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:25,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-01 14:12:25,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:25,453 INFO L225 Difference]: With dead ends: 101388 [2018-12-01 14:12:25,453 INFO L226 Difference]: Without dead ends: 68618 [2018-12-01 14:12:25,470 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-12-01 14:12:25,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68618 states. [2018-12-01 14:12:26,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68618 to 68616. [2018-12-01 14:12:26,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68616 states. [2018-12-01 14:12:26,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68616 states to 68616 states and 78854 transitions. [2018-12-01 14:12:26,319 INFO L78 Accepts]: Start accepts. Automaton has 68616 states and 78854 transitions. Word has length 33 [2018-12-01 14:12:26,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:26,320 INFO L480 AbstractCegarLoop]: Abstraction has 68616 states and 78854 transitions. [2018-12-01 14:12:26,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:26,320 INFO L276 IsEmpty]: Start isEmpty. Operand 68616 states and 78854 transitions. [2018-12-01 14:12:26,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-01 14:12:26,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:26,340 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, 1, 1, 1, 1] [2018-12-01 14:12:26,340 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:26,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:26,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1704567628, now seen corresponding path program 1 times [2018-12-01 14:12:26,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:26,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:26,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:26,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:26,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:26,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:26,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:26,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:26,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:26,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:26,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:26,349 INFO L87 Difference]: Start difference. First operand 68616 states and 78854 transitions. Second operand 3 states. [2018-12-01 14:12:27,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:27,342 INFO L93 Difference]: Finished difference Result 110602 states and 125959 transitions. [2018-12-01 14:12:27,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:27,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-01 14:12:27,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:27,415 INFO L225 Difference]: With dead ends: 110602 [2018-12-01 14:12:27,415 INFO L226 Difference]: Without dead ends: 110600 [2018-12-01 14:12:27,426 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-12-01 14:12:27,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110600 states. [2018-12-01 14:12:28,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110600 to 106504. [2018-12-01 14:12:28,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106504 states. [2018-12-01 14:12:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106504 states to 106504 states and 119814 transitions. [2018-12-01 14:12:28,763 INFO L78 Accepts]: Start accepts. Automaton has 106504 states and 119814 transitions. Word has length 33 [2018-12-01 14:12:28,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:28,763 INFO L480 AbstractCegarLoop]: Abstraction has 106504 states and 119814 transitions. [2018-12-01 14:12:28,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:28,763 INFO L276 IsEmpty]: Start isEmpty. Operand 106504 states and 119814 transitions. [2018-12-01 14:12:28,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-01 14:12:28,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:12:28,807 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, 1, 1, 1, 1] [2018-12-01 14:12:28,807 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:12:28,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:12:28,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1310535990, now seen corresponding path program 1 times [2018-12-01 14:12:28,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:12:28,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:12:28,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:28,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:12:28,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:12:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:12:28,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:12:28,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:12:28,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:12:28,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:12:28,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:12:28,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:12:28,818 INFO L87 Difference]: Start difference. First operand 106504 states and 119814 transitions. Second operand 3 states. [2018-12-01 14:12:30,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:12:30,103 INFO L93 Difference]: Finished difference Result 237576 states and 263174 transitions. [2018-12-01 14:12:30,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:12:30,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-01 14:12:30,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:12:30,103 INFO L225 Difference]: With dead ends: 237576 [2018-12-01 14:12:30,103 INFO L226 Difference]: Without dead ends: 0 [2018-12-01 14:12:30,205 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-12-01 14:12:30,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-01 14:12:30,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-01 14:12:30,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-01 14:12:30,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-01 14:12:30,205 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-12-01 14:12:30,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:12:30,206 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 14:12:30,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:12:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-01 14:12:30,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-01 14:12:30,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-01 14:12:30,234 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-01 14:12:30,234 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-01 14:12:30,234 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-01 14:12:30,234 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-01 14:12:30,234 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-01 14:12:30,234 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-01 14:12:30,234 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2018-12-01 14:12:30,234 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 191) no Hoare annotation was computed. [2018-12-01 14:12:30,234 INFO L448 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2018-12-01 14:12:30,234 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2018-12-01 14:12:30,234 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-12-01 14:12:30,234 INFO L448 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-12-01 14:12:30,234 INFO L448 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-12-01 14:12:30,234 INFO L448 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2018-12-01 14:12:30,234 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2018-12-01 14:12:30,235 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2018-12-01 14:12:30,235 INFO L448 ceAbstractionStarter]: For program point L112-1(lines 45 186) no Hoare annotation was computed. [2018-12-01 14:12:30,235 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 191) no Hoare annotation was computed. [2018-12-01 14:12:30,235 INFO L448 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2018-12-01 14:12:30,235 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 45 186) no Hoare annotation was computed. [2018-12-01 14:12:30,235 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-12-01 14:12:30,235 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 45 186) no Hoare annotation was computed. [2018-12-01 14:12:30,235 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 191) the Hoare annotation is: true [2018-12-01 14:12:30,235 INFO L451 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true [2018-12-01 14:12:30,235 INFO L448 ceAbstractionStarter]: For program point L88-1(lines 45 186) no Hoare annotation was computed. [2018-12-01 14:12:30,235 INFO L448 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2018-12-01 14:12:30,235 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2018-12-01 14:12:30,235 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 45 186) no Hoare annotation was computed. [2018-12-01 14:12:30,235 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2018-12-01 14:12:30,235 INFO L448 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-12-01 14:12:30,235 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-12-01 14:12:30,235 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2018-12-01 14:12:30,235 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2018-12-01 14:12:30,235 INFO L451 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2018-12-01 14:12:30,235 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-12-01 14:12:30,235 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-12-01 14:12:30,236 INFO L448 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2018-12-01 14:12:30,236 INFO L444 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2018-12-01 14:12:30,236 INFO L448 ceAbstractionStarter]: For program point L116-1(lines 45 186) no Hoare annotation was computed. [2018-12-01 14:12:30,236 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2018-12-01 14:12:30,236 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 45 186) no Hoare annotation was computed. [2018-12-01 14:12:30,236 INFO L448 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2018-12-01 14:12:30,236 INFO L448 ceAbstractionStarter]: For program point L100-1(lines 45 186) no Hoare annotation was computed. [2018-12-01 14:12:30,236 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 45 186) no Hoare annotation was computed. [2018-12-01 14:12:30,236 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 45 186) no Hoare annotation was computed. [2018-12-01 14:12:30,236 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2018-12-01 14:12:30,236 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-12-01 14:12:30,236 INFO L448 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2018-12-01 14:12:30,236 INFO L448 ceAbstractionStarter]: For program point L76-2(lines 45 186) no Hoare annotation was computed. [2018-12-01 14:12:30,236 INFO L448 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2018-12-01 14:12:30,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 02:12:30 BoogieIcfgContainer [2018-12-01 14:12:30,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 14:12:30,241 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 14:12:30,241 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 14:12:30,241 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 14:12:30,241 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 02:12:16" (3/4) ... [2018-12-01 14:12:30,244 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-01 14:12:30,249 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-01 14:12:30,249 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-01 14:12:30,253 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-01 14:12:30,253 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-01 14:12:30,253 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-01 14:12:30,295 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9eb39c4b-048b-4c49-a794-83364067e896/bin-2019/uautomizer/witness.graphml [2018-12-01 14:12:30,295 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 14:12:30,296 INFO L168 Benchmark]: Toolchain (without parser) took 14335.64 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 953.3 MB in the beginning and 707.0 MB in the end (delta: 246.3 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-12-01 14:12:30,297 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 14:12:30,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 135.43 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-01 14:12:30,297 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.59 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-01 14:12:30,298 INFO L168 Benchmark]: Boogie Preprocessor took 47.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-12-01 14:12:30,298 INFO L168 Benchmark]: RCFGBuilder took 205.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-12-01 14:12:30,298 INFO L168 Benchmark]: TraceAbstraction took 13878.39 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 707.5 MB in the end (delta: 374.4 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-12-01 14:12:30,299 INFO L168 Benchmark]: Witness Printer took 54.28 ms. Allocated memory is still 2.7 GB. Free memory was 707.5 MB in the beginning and 707.0 MB in the end (delta: 520.7 kB). Peak memory consumption was 520.7 kB. Max. memory is 11.5 GB. [2018-12-01 14:12:30,300 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 135.43 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 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 11.59 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 205.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13878.39 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 707.5 MB in the end (delta: 374.4 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 54.28 ms. Allocated memory is still 2.7 GB. Free memory was 707.5 MB in the beginning and 707.0 MB in the end (delta: 520.7 kB). Peak memory consumption was 520.7 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: 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: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 50 locations, 1 error locations. SAFE Result, 13.8s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 6.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3416 SDtfs, 1682 SDslu, 2343 SDs, 0 SdLazy, 181 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106504occurred in iteration=33, 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: 6.3s AutomataMinimizationTime, 34 MinimizatonAttempts, 16420 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 4106 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 938 NumberOfCodeBlocks, 938 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 904 ConstructedInterpolants, 0 QuantifiedInterpolants, 49976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...