./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_49257edf-bc1c-4a08-9b5f-b98516f16b9c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_49257edf-bc1c-4a08-9b5f-b98516f16b9c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_49257edf-bc1c-4a08-9b5f-b98516f16b9c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_49257edf-bc1c-4a08-9b5f-b98516f16b9c/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_49257edf-bc1c-4a08-9b5f-b98516f16b9c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_49257edf-bc1c-4a08-9b5f-b98516f16b9c/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 129b0578c0c64625cef50fbcfd5d128651ff3275 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:13:07,448 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:13:07,448 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:13:07,454 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:13:07,455 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:13:07,455 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:13:07,456 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:13:07,458 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:13:07,459 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:13:07,460 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:13:07,461 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:13:07,461 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:13:07,461 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:13:07,462 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:13:07,463 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:13:07,463 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:13:07,464 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:13:07,466 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:13:07,468 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:13:07,469 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:13:07,470 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:13:07,471 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:13:07,472 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:13:07,472 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:13:07,473 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:13:07,474 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:13:07,474 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:13:07,475 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:13:07,475 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:13:07,476 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:13:07,476 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:13:07,477 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:13:07,477 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:13:07,477 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:13:07,478 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:13:07,478 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:13:07,478 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_49257edf-bc1c-4a08-9b5f-b98516f16b9c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 12:13:07,488 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:13:07,488 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:13:07,489 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 12:13:07,489 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 12:13:07,490 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:13:07,490 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:13:07,490 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:13:07,490 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:13:07,490 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:13:07,491 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:13:07,491 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:13:07,491 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:13:07,491 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 12:13:07,491 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 12:13:07,491 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 12:13:07,491 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:13:07,492 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:13:07,492 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:13:07,492 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 12:13:07,492 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:13:07,492 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:13:07,492 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 12:13:07,493 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 12:13:07,493 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:13:07,493 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:13:07,493 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 12:13:07,493 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 12:13:07,493 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:13:07,493 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 12:13:07,494 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 12:13:07,494 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_49257edf-bc1c-4a08-9b5f-b98516f16b9c/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 -> 129b0578c0c64625cef50fbcfd5d128651ff3275 [2018-11-28 12:13:07,517 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:13:07,525 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:13:07,527 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:13:07,528 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:13:07,528 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:13:07,528 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_49257edf-bc1c-4a08-9b5f-b98516f16b9c/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 12:13:07,565 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_49257edf-bc1c-4a08-9b5f-b98516f16b9c/bin-2019/uautomizer/data/078fa8338/4d89d067379e425cb641008c88611b52/FLAGa4d41fdde [2018-11-28 12:13:07,996 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:13:07,997 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_49257edf-bc1c-4a08-9b5f-b98516f16b9c/sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 12:13:08,005 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_49257edf-bc1c-4a08-9b5f-b98516f16b9c/bin-2019/uautomizer/data/078fa8338/4d89d067379e425cb641008c88611b52/FLAGa4d41fdde [2018-11-28 12:13:08,017 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_49257edf-bc1c-4a08-9b5f-b98516f16b9c/bin-2019/uautomizer/data/078fa8338/4d89d067379e425cb641008c88611b52 [2018-11-28 12:13:08,019 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:13:08,020 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:13:08,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:13:08,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:13:08,023 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:13:08,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:13:08" (1/1) ... [2018-11-28 12:13:08,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ff38d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:08, skipping insertion in model container [2018-11-28 12:13:08,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:13:08" (1/1) ... [2018-11-28 12:13:08,031 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:13:08,051 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:13:08,185 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:13:08,189 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:13:08,213 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:13:08,223 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:13:08,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:08 WrapperNode [2018-11-28 12:13:08,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:13:08,224 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:13:08,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:13:08,224 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:13:08,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:08" (1/1) ... [2018-11-28 12:13:08,240 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:08" (1/1) ... [2018-11-28 12:13:08,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:13:08,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:13:08,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:13:08,291 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:13:08,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:08" (1/1) ... [2018-11-28 12:13:08,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:08" (1/1) ... [2018-11-28 12:13:08,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:08" (1/1) ... [2018-11-28 12:13:08,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:08" (1/1) ... [2018-11-28 12:13:08,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:08" (1/1) ... [2018-11-28 12:13:08,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:08" (1/1) ... [2018-11-28 12:13:08,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:08" (1/1) ... [2018-11-28 12:13:08,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:13:08,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:13:08,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:13:08,320 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:13:08,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_49257edf-bc1c-4a08-9b5f-b98516f16b9c/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:13:08,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 12:13:08,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 12:13:08,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:13:08,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:13:08,370 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 12:13:08,370 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 12:13:08,684 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:13:08,684 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 12:13:08,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:13:08 BoogieIcfgContainer [2018-11-28 12:13:08,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:13:08,685 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 12:13:08,685 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 12:13:08,689 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 12:13:08,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:13:08" (1/3) ... [2018-11-28 12:13:08,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f6f6cd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:13:08, skipping insertion in model container [2018-11-28 12:13:08,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:08" (2/3) ... [2018-11-28 12:13:08,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f6f6cd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:13:08, skipping insertion in model container [2018-11-28 12:13:08,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:13:08" (3/3) ... [2018-11-28 12:13:08,692 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 12:13:08,703 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 12:13:08,711 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 12:13:08,728 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 12:13:08,761 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:13:08,761 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 12:13:08,762 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 12:13:08,762 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 12:13:08,762 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:13:08,762 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:13:08,762 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 12:13:08,762 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:13:08,762 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 12:13:08,782 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-11-28 12:13:08,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 12:13:08,789 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:08,789 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:13:08,791 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:08,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:08,796 INFO L82 PathProgramCache]: Analyzing trace with hash -563360106, now seen corresponding path program 1 times [2018-11-28 12:13:08,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:08,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:08,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:08,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:08,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:08,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:08,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:08,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:08,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:08,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:08,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:08,995 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-11-28 12:13:09,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:09,045 INFO L93 Difference]: Finished difference Result 117 states and 210 transitions. [2018-11-28 12:13:09,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:09,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 12:13:09,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:09,061 INFO L225 Difference]: With dead ends: 117 [2018-11-28 12:13:09,061 INFO L226 Difference]: Without dead ends: 102 [2018-11-28 12:13:09,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:09,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-28 12:13:09,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 70. [2018-11-28 12:13:09,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-28 12:13:09,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 129 transitions. [2018-11-28 12:13:09,098 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 129 transitions. Word has length 25 [2018-11-28 12:13:09,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:09,099 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 129 transitions. [2018-11-28 12:13:09,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:09,099 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 129 transitions. [2018-11-28 12:13:09,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 12:13:09,100 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:09,101 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:13:09,101 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:09,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:09,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1737462484, now seen corresponding path program 1 times [2018-11-28 12:13:09,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:09,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:09,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:09,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:09,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:09,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:09,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:09,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:09,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:09,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:09,179 INFO L87 Difference]: Start difference. First operand 70 states and 129 transitions. Second operand 3 states. [2018-11-28 12:13:09,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:09,205 INFO L93 Difference]: Finished difference Result 167 states and 312 transitions. [2018-11-28 12:13:09,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:09,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 12:13:09,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:09,207 INFO L225 Difference]: With dead ends: 167 [2018-11-28 12:13:09,207 INFO L226 Difference]: Without dead ends: 102 [2018-11-28 12:13:09,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:09,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-28 12:13:09,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-11-28 12:13:09,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-28 12:13:09,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 185 transitions. [2018-11-28 12:13:09,218 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 185 transitions. Word has length 25 [2018-11-28 12:13:09,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:09,219 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 185 transitions. [2018-11-28 12:13:09,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:09,219 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 185 transitions. [2018-11-28 12:13:09,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 12:13:09,220 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:09,220 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:13:09,220 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:09,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:09,220 INFO L82 PathProgramCache]: Analyzing trace with hash -284082342, now seen corresponding path program 1 times [2018-11-28 12:13:09,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:09,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:09,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:09,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:09,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:09,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:09,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:09,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:09,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:09,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:09,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:09,261 INFO L87 Difference]: Start difference. First operand 100 states and 185 transitions. Second operand 3 states. [2018-11-28 12:13:09,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:09,293 INFO L93 Difference]: Finished difference Result 153 states and 279 transitions. [2018-11-28 12:13:09,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:09,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 12:13:09,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:09,295 INFO L225 Difference]: With dead ends: 153 [2018-11-28 12:13:09,295 INFO L226 Difference]: Without dead ends: 105 [2018-11-28 12:13:09,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:09,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-28 12:13:09,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-11-28 12:13:09,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-28 12:13:09,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 187 transitions. [2018-11-28 12:13:09,303 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 187 transitions. Word has length 26 [2018-11-28 12:13:09,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:09,304 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 187 transitions. [2018-11-28 12:13:09,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:09,304 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2018-11-28 12:13:09,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 12:13:09,304 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:09,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:13:09,305 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:09,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:09,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1973026084, now seen corresponding path program 1 times [2018-11-28 12:13:09,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:09,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:09,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:09,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:09,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:09,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:09,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:09,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:09,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:09,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:09,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:09,343 INFO L87 Difference]: Start difference. First operand 103 states and 187 transitions. Second operand 3 states. [2018-11-28 12:13:09,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:09,369 INFO L93 Difference]: Finished difference Result 196 states and 360 transitions. [2018-11-28 12:13:09,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:09,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 12:13:09,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:09,370 INFO L225 Difference]: With dead ends: 196 [2018-11-28 12:13:09,370 INFO L226 Difference]: Without dead ends: 194 [2018-11-28 12:13:09,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:09,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-28 12:13:09,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 136. [2018-11-28 12:13:09,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-28 12:13:09,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 248 transitions. [2018-11-28 12:13:09,379 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 248 transitions. Word has length 26 [2018-11-28 12:13:09,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:09,379 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 248 transitions. [2018-11-28 12:13:09,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:09,380 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 248 transitions. [2018-11-28 12:13:09,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 12:13:09,380 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:09,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:13:09,381 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:09,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:09,381 INFO L82 PathProgramCache]: Analyzing trace with hash 327796506, now seen corresponding path program 1 times [2018-11-28 12:13:09,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:09,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:09,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:09,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:09,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:09,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:09,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:09,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:09,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:09,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:09,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:09,410 INFO L87 Difference]: Start difference. First operand 136 states and 248 transitions. Second operand 3 states. [2018-11-28 12:13:09,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:09,449 INFO L93 Difference]: Finished difference Result 324 states and 598 transitions. [2018-11-28 12:13:09,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:09,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 12:13:09,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:09,452 INFO L225 Difference]: With dead ends: 324 [2018-11-28 12:13:09,452 INFO L226 Difference]: Without dead ends: 196 [2018-11-28 12:13:09,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:09,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-11-28 12:13:09,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2018-11-28 12:13:09,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-28 12:13:09,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 354 transitions. [2018-11-28 12:13:09,465 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 354 transitions. Word has length 26 [2018-11-28 12:13:09,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:09,465 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 354 transitions. [2018-11-28 12:13:09,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:09,465 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 354 transitions. [2018-11-28 12:13:09,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 12:13:09,466 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:09,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:13:09,467 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:09,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:09,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1034054359, now seen corresponding path program 1 times [2018-11-28 12:13:09,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:09,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:09,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:09,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:09,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:09,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:09,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:09,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:09,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:09,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:09,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:09,511 INFO L87 Difference]: Start difference. First operand 194 states and 354 transitions. Second operand 3 states. [2018-11-28 12:13:09,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:09,534 INFO L93 Difference]: Finished difference Result 291 states and 529 transitions. [2018-11-28 12:13:09,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:09,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 12:13:09,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:09,536 INFO L225 Difference]: With dead ends: 291 [2018-11-28 12:13:09,536 INFO L226 Difference]: Without dead ends: 198 [2018-11-28 12:13:09,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:09,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-28 12:13:09,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2018-11-28 12:13:09,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-11-28 12:13:09,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 354 transitions. [2018-11-28 12:13:09,546 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 354 transitions. Word has length 27 [2018-11-28 12:13:09,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:09,547 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 354 transitions. [2018-11-28 12:13:09,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:09,547 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 354 transitions. [2018-11-28 12:13:09,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 12:13:09,548 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:09,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:13:09,548 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:09,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:09,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1571969195, now seen corresponding path program 1 times [2018-11-28 12:13:09,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:09,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:09,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:09,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:09,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:09,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:09,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:09,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:09,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:09,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:09,591 INFO L87 Difference]: Start difference. First operand 196 states and 354 transitions. Second operand 3 states. [2018-11-28 12:13:09,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:09,624 INFO L93 Difference]: Finished difference Result 372 states and 680 transitions. [2018-11-28 12:13:09,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:09,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 12:13:09,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:09,627 INFO L225 Difference]: With dead ends: 372 [2018-11-28 12:13:09,627 INFO L226 Difference]: Without dead ends: 370 [2018-11-28 12:13:09,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:09,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-11-28 12:13:09,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 264. [2018-11-28 12:13:09,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-11-28 12:13:09,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 474 transitions. [2018-11-28 12:13:09,638 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 474 transitions. Word has length 27 [2018-11-28 12:13:09,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:09,638 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 474 transitions. [2018-11-28 12:13:09,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:09,639 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 474 transitions. [2018-11-28 12:13:09,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 12:13:09,640 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:09,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:13:09,640 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:09,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:09,640 INFO L82 PathProgramCache]: Analyzing trace with hash -422175511, now seen corresponding path program 1 times [2018-11-28 12:13:09,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:09,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:09,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:09,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:09,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:09,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:09,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:09,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:09,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:09,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:09,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:09,675 INFO L87 Difference]: Start difference. First operand 264 states and 474 transitions. Second operand 3 states. [2018-11-28 12:13:09,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:09,694 INFO L93 Difference]: Finished difference Result 632 states and 1144 transitions. [2018-11-28 12:13:09,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:09,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 12:13:09,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:09,696 INFO L225 Difference]: With dead ends: 632 [2018-11-28 12:13:09,696 INFO L226 Difference]: Without dead ends: 378 [2018-11-28 12:13:09,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:09,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-11-28 12:13:09,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 376. [2018-11-28 12:13:09,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-11-28 12:13:09,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 674 transitions. [2018-11-28 12:13:09,707 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 674 transitions. Word has length 27 [2018-11-28 12:13:09,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:09,709 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 674 transitions. [2018-11-28 12:13:09,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:09,709 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 674 transitions. [2018-11-28 12:13:09,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 12:13:09,710 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:09,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:13:09,711 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:09,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:09,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1486617231, now seen corresponding path program 1 times [2018-11-28 12:13:09,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:09,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:09,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:09,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:09,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:09,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:09,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:09,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:09,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:09,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:09,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:09,731 INFO L87 Difference]: Start difference. First operand 376 states and 674 transitions. Second operand 3 states. [2018-11-28 12:13:09,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:09,754 INFO L93 Difference]: Finished difference Result 564 states and 1008 transitions. [2018-11-28 12:13:09,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:09,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 12:13:09,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:09,756 INFO L225 Difference]: With dead ends: 564 [2018-11-28 12:13:09,756 INFO L226 Difference]: Without dead ends: 382 [2018-11-28 12:13:09,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:09,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-28 12:13:09,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 380. [2018-11-28 12:13:09,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-28 12:13:09,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 674 transitions. [2018-11-28 12:13:09,765 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 674 transitions. Word has length 28 [2018-11-28 12:13:09,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:09,765 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 674 transitions. [2018-11-28 12:13:09,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:09,766 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 674 transitions. [2018-11-28 12:13:09,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 12:13:09,767 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:09,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:13:09,767 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:09,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:09,767 INFO L82 PathProgramCache]: Analyzing trace with hash -202326511, now seen corresponding path program 1 times [2018-11-28 12:13:09,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:09,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:09,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:09,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:09,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:09,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:09,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:09,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:09,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:09,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:09,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:09,792 INFO L87 Difference]: Start difference. First operand 380 states and 674 transitions. Second operand 3 states. [2018-11-28 12:13:09,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:09,820 INFO L93 Difference]: Finished difference Result 716 states and 1288 transitions. [2018-11-28 12:13:09,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:09,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 12:13:09,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:09,823 INFO L225 Difference]: With dead ends: 716 [2018-11-28 12:13:09,823 INFO L226 Difference]: Without dead ends: 714 [2018-11-28 12:13:09,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:09,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-11-28 12:13:09,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 520. [2018-11-28 12:13:09,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-11-28 12:13:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 910 transitions. [2018-11-28 12:13:09,839 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 910 transitions. Word has length 28 [2018-11-28 12:13:09,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:09,840 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 910 transitions. [2018-11-28 12:13:09,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:09,840 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 910 transitions. [2018-11-28 12:13:09,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 12:13:09,841 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:09,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:13:09,842 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:09,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:09,842 INFO L82 PathProgramCache]: Analyzing trace with hash 2098496079, now seen corresponding path program 1 times [2018-11-28 12:13:09,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:09,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:09,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:09,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:09,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:09,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:09,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:09,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:09,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:09,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:09,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:09,868 INFO L87 Difference]: Start difference. First operand 520 states and 910 transitions. Second operand 3 states. [2018-11-28 12:13:09,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:09,899 INFO L93 Difference]: Finished difference Result 1244 states and 2192 transitions. [2018-11-28 12:13:09,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:09,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 12:13:09,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:09,903 INFO L225 Difference]: With dead ends: 1244 [2018-11-28 12:13:09,903 INFO L226 Difference]: Without dead ends: 738 [2018-11-28 12:13:09,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:09,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-11-28 12:13:09,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 736. [2018-11-28 12:13:09,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-11-28 12:13:09,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1286 transitions. [2018-11-28 12:13:09,935 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1286 transitions. Word has length 28 [2018-11-28 12:13:09,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:09,935 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 1286 transitions. [2018-11-28 12:13:09,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:09,936 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1286 transitions. [2018-11-28 12:13:09,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 12:13:09,937 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:09,937 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:13:09,937 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:09,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:09,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1976941762, now seen corresponding path program 1 times [2018-11-28 12:13:09,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:09,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:09,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:09,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:09,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:09,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:09,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:09,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:09,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:09,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:09,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:09,972 INFO L87 Difference]: Start difference. First operand 736 states and 1286 transitions. Second operand 3 states. [2018-11-28 12:13:10,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:10,011 INFO L93 Difference]: Finished difference Result 1104 states and 1924 transitions. [2018-11-28 12:13:10,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:10,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 12:13:10,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:10,015 INFO L225 Difference]: With dead ends: 1104 [2018-11-28 12:13:10,015 INFO L226 Difference]: Without dead ends: 746 [2018-11-28 12:13:10,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:10,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-11-28 12:13:10,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2018-11-28 12:13:10,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-11-28 12:13:10,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1286 transitions. [2018-11-28 12:13:10,044 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1286 transitions. Word has length 29 [2018-11-28 12:13:10,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:10,044 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 1286 transitions. [2018-11-28 12:13:10,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:10,044 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1286 transitions. [2018-11-28 12:13:10,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 12:13:10,046 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:10,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:13:10,047 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:10,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:10,047 INFO L82 PathProgramCache]: Analyzing trace with hash 629081792, now seen corresponding path program 1 times [2018-11-28 12:13:10,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:10,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:10,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:10,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:10,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:10,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:10,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:10,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:10,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:10,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:10,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:10,080 INFO L87 Difference]: Start difference. First operand 744 states and 1286 transitions. Second operand 3 states. [2018-11-28 12:13:10,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:10,117 INFO L93 Difference]: Finished difference Result 1388 states and 2440 transitions. [2018-11-28 12:13:10,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:10,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 12:13:10,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:10,125 INFO L225 Difference]: With dead ends: 1388 [2018-11-28 12:13:10,125 INFO L226 Difference]: Without dead ends: 1386 [2018-11-28 12:13:10,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:10,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2018-11-28 12:13:10,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1032. [2018-11-28 12:13:10,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2018-11-28 12:13:10,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1750 transitions. [2018-11-28 12:13:10,164 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1750 transitions. Word has length 29 [2018-11-28 12:13:10,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:10,165 INFO L480 AbstractCegarLoop]: Abstraction has 1032 states and 1750 transitions. [2018-11-28 12:13:10,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:10,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1750 transitions. [2018-11-28 12:13:10,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 12:13:10,167 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:10,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:13:10,167 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:10,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:10,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1365062914, now seen corresponding path program 1 times [2018-11-28 12:13:10,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:10,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:10,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:10,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:10,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:10,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:10,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:10,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:10,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:10,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:10,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:10,190 INFO L87 Difference]: Start difference. First operand 1032 states and 1750 transitions. Second operand 3 states. [2018-11-28 12:13:10,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:10,251 INFO L93 Difference]: Finished difference Result 2460 states and 4200 transitions. [2018-11-28 12:13:10,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:10,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 12:13:10,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:10,258 INFO L225 Difference]: With dead ends: 2460 [2018-11-28 12:13:10,258 INFO L226 Difference]: Without dead ends: 1450 [2018-11-28 12:13:10,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:10,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2018-11-28 12:13:10,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1448. [2018-11-28 12:13:10,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1448 states. [2018-11-28 12:13:10,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 2454 transitions. [2018-11-28 12:13:10,314 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 2454 transitions. Word has length 29 [2018-11-28 12:13:10,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:10,315 INFO L480 AbstractCegarLoop]: Abstraction has 1448 states and 2454 transitions. [2018-11-28 12:13:10,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:10,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 2454 transitions. [2018-11-28 12:13:10,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 12:13:10,317 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:10,317 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-11-28 12:13:10,318 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:10,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:10,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1973087804, now seen corresponding path program 1 times [2018-11-28 12:13:10,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:10,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:10,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:10,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:10,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:10,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:10,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:10,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:10,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:10,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:10,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:10,364 INFO L87 Difference]: Start difference. First operand 1448 states and 2454 transitions. Second operand 3 states. [2018-11-28 12:13:10,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:10,419 INFO L93 Difference]: Finished difference Result 2172 states and 3672 transitions. [2018-11-28 12:13:10,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:10,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 12:13:10,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:10,425 INFO L225 Difference]: With dead ends: 2172 [2018-11-28 12:13:10,426 INFO L226 Difference]: Without dead ends: 1466 [2018-11-28 12:13:10,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:10,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2018-11-28 12:13:10,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1464. [2018-11-28 12:13:10,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2018-11-28 12:13:10,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2454 transitions. [2018-11-28 12:13:10,487 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2454 transitions. Word has length 30 [2018-11-28 12:13:10,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:10,488 INFO L480 AbstractCegarLoop]: Abstraction has 1464 states and 2454 transitions. [2018-11-28 12:13:10,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:10,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2454 transitions. [2018-11-28 12:13:10,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 12:13:10,490 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:10,490 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-11-28 12:13:10,491 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:10,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:10,491 INFO L82 PathProgramCache]: Analyzing trace with hash 632935750, now seen corresponding path program 1 times [2018-11-28 12:13:10,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:10,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:10,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:10,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:10,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:10,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:10,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:10,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:10,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:10,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:10,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:10,523 INFO L87 Difference]: Start difference. First operand 1464 states and 2454 transitions. Second operand 3 states. [2018-11-28 12:13:10,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:10,571 INFO L93 Difference]: Finished difference Result 2700 states and 4616 transitions. [2018-11-28 12:13:10,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:10,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 12:13:10,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:10,582 INFO L225 Difference]: With dead ends: 2700 [2018-11-28 12:13:10,583 INFO L226 Difference]: Without dead ends: 2698 [2018-11-28 12:13:10,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:10,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2018-11-28 12:13:10,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2056. [2018-11-28 12:13:10,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2018-11-28 12:13:10,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 3366 transitions. [2018-11-28 12:13:10,651 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 3366 transitions. Word has length 30 [2018-11-28 12:13:10,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:10,652 INFO L480 AbstractCegarLoop]: Abstraction has 2056 states and 3366 transitions. [2018-11-28 12:13:10,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:10,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 3366 transitions. [2018-11-28 12:13:10,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 12:13:10,655 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:10,655 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-11-28 12:13:10,655 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:10,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:10,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1361208956, now seen corresponding path program 1 times [2018-11-28 12:13:10,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:10,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:10,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:10,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:10,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:10,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:10,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:10,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:10,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:10,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:10,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:10,677 INFO L87 Difference]: Start difference. First operand 2056 states and 3366 transitions. Second operand 3 states. [2018-11-28 12:13:10,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:10,737 INFO L93 Difference]: Finished difference Result 4876 states and 8040 transitions. [2018-11-28 12:13:10,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:10,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 12:13:10,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:10,747 INFO L225 Difference]: With dead ends: 4876 [2018-11-28 12:13:10,747 INFO L226 Difference]: Without dead ends: 2858 [2018-11-28 12:13:10,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:10,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2018-11-28 12:13:10,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2856. [2018-11-28 12:13:10,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2856 states. [2018-11-28 12:13:10,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 4678 transitions. [2018-11-28 12:13:10,829 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 4678 transitions. Word has length 30 [2018-11-28 12:13:10,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:10,829 INFO L480 AbstractCegarLoop]: Abstraction has 2856 states and 4678 transitions. [2018-11-28 12:13:10,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:10,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 4678 transitions. [2018-11-28 12:13:10,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 12:13:10,832 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:10,832 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-11-28 12:13:10,832 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:10,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:10,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1853614765, now seen corresponding path program 1 times [2018-11-28 12:13:10,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:10,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:10,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:10,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:10,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:10,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:10,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:10,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:10,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:10,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:10,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:10,855 INFO L87 Difference]: Start difference. First operand 2856 states and 4678 transitions. Second operand 3 states. [2018-11-28 12:13:10,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:10,909 INFO L93 Difference]: Finished difference Result 4284 states and 7000 transitions. [2018-11-28 12:13:10,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:10,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 12:13:10,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:10,919 INFO L225 Difference]: With dead ends: 4284 [2018-11-28 12:13:10,919 INFO L226 Difference]: Without dead ends: 2890 [2018-11-28 12:13:10,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:10,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2018-11-28 12:13:10,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 2888. [2018-11-28 12:13:10,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2888 states. [2018-11-28 12:13:11,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 4678 transitions. [2018-11-28 12:13:11,000 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 4678 transitions. Word has length 31 [2018-11-28 12:13:11,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:11,001 INFO L480 AbstractCegarLoop]: Abstraction has 2888 states and 4678 transitions. [2018-11-28 12:13:11,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 4678 transitions. [2018-11-28 12:13:11,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 12:13:11,004 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:11,004 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-11-28 12:13:11,004 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:11,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:11,005 INFO L82 PathProgramCache]: Analyzing trace with hash 752408789, now seen corresponding path program 1 times [2018-11-28 12:13:11,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:11,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:11,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:11,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:11,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:11,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:11,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:11,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:11,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:11,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:11,031 INFO L87 Difference]: Start difference. First operand 2888 states and 4678 transitions. Second operand 3 states. [2018-11-28 12:13:11,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:11,118 INFO L93 Difference]: Finished difference Result 5260 states and 8712 transitions. [2018-11-28 12:13:11,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:11,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 12:13:11,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:11,136 INFO L225 Difference]: With dead ends: 5260 [2018-11-28 12:13:11,136 INFO L226 Difference]: Without dead ends: 5258 [2018-11-28 12:13:11,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:11,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2018-11-28 12:13:11,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 4104. [2018-11-28 12:13:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2018-11-28 12:13:11,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 6470 transitions. [2018-11-28 12:13:11,245 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 6470 transitions. Word has length 31 [2018-11-28 12:13:11,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:11,245 INFO L480 AbstractCegarLoop]: Abstraction has 4104 states and 6470 transitions. [2018-11-28 12:13:11,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:11,246 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 6470 transitions. [2018-11-28 12:13:11,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 12:13:11,251 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:11,251 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-11-28 12:13:11,251 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:11,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:11,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1241735917, now seen corresponding path program 1 times [2018-11-28 12:13:11,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:11,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:11,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:11,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:11,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:11,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:11,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:11,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:11,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:11,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:11,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:11,275 INFO L87 Difference]: Start difference. First operand 4104 states and 6470 transitions. Second operand 3 states. [2018-11-28 12:13:11,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:11,371 INFO L93 Difference]: Finished difference Result 9676 states and 15368 transitions. [2018-11-28 12:13:11,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:11,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 12:13:11,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:11,390 INFO L225 Difference]: With dead ends: 9676 [2018-11-28 12:13:11,390 INFO L226 Difference]: Without dead ends: 5642 [2018-11-28 12:13:11,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:11,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2018-11-28 12:13:11,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5640. [2018-11-28 12:13:11,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5640 states. [2018-11-28 12:13:11,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5640 states to 5640 states and 8902 transitions. [2018-11-28 12:13:11,568 INFO L78 Accepts]: Start accepts. Automaton has 5640 states and 8902 transitions. Word has length 31 [2018-11-28 12:13:11,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:11,569 INFO L480 AbstractCegarLoop]: Abstraction has 5640 states and 8902 transitions. [2018-11-28 12:13:11,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:11,569 INFO L276 IsEmpty]: Start isEmpty. Operand 5640 states and 8902 transitions. [2018-11-28 12:13:11,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 12:13:11,574 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:11,574 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-11-28 12:13:11,574 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:11,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:11,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1850049785, now seen corresponding path program 1 times [2018-11-28 12:13:11,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:11,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:11,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:11,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:11,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:11,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:11,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:11,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:11,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:11,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:11,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:11,591 INFO L87 Difference]: Start difference. First operand 5640 states and 8902 transitions. Second operand 3 states. [2018-11-28 12:13:11,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:11,675 INFO L93 Difference]: Finished difference Result 8460 states and 13320 transitions. [2018-11-28 12:13:11,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:11,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-28 12:13:11,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:11,686 INFO L225 Difference]: With dead ends: 8460 [2018-11-28 12:13:11,686 INFO L226 Difference]: Without dead ends: 5706 [2018-11-28 12:13:11,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:11,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5706 states. [2018-11-28 12:13:11,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5706 to 5704. [2018-11-28 12:13:11,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5704 states. [2018-11-28 12:13:11,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5704 states to 5704 states and 8902 transitions. [2018-11-28 12:13:11,816 INFO L78 Accepts]: Start accepts. Automaton has 5704 states and 8902 transitions. Word has length 32 [2018-11-28 12:13:11,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:11,816 INFO L480 AbstractCegarLoop]: Abstraction has 5704 states and 8902 transitions. [2018-11-28 12:13:11,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:11,816 INFO L276 IsEmpty]: Start isEmpty. Operand 5704 states and 8902 transitions. [2018-11-28 12:13:11,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 12:13:11,821 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:11,822 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-11-28 12:13:11,822 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:11,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:11,822 INFO L82 PathProgramCache]: Analyzing trace with hash 161106043, now seen corresponding path program 1 times [2018-11-28 12:13:11,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:11,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:11,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:11,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:11,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:11,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:11,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:11,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:11,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:11,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:11,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:11,847 INFO L87 Difference]: Start difference. First operand 5704 states and 8902 transitions. Second operand 3 states. [2018-11-28 12:13:11,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:11,976 INFO L93 Difference]: Finished difference Result 16716 states and 25928 transitions. [2018-11-28 12:13:11,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:11,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-28 12:13:11,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:11,995 INFO L225 Difference]: With dead ends: 16716 [2018-11-28 12:13:11,995 INFO L226 Difference]: Without dead ends: 11146 [2018-11-28 12:13:12,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:12,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2018-11-28 12:13:12,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 11144. [2018-11-28 12:13:12,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2018-11-28 12:13:12,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 17030 transitions. [2018-11-28 12:13:12,236 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 17030 transitions. Word has length 32 [2018-11-28 12:13:12,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:12,237 INFO L480 AbstractCegarLoop]: Abstraction has 11144 states and 17030 transitions. [2018-11-28 12:13:12,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:12,237 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 17030 transitions. [2018-11-28 12:13:12,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 12:13:12,248 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:12,248 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-11-28 12:13:12,249 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:12,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:12,249 INFO L82 PathProgramCache]: Analyzing trace with hash -2139716547, now seen corresponding path program 1 times [2018-11-28 12:13:12,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:12,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:12,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:12,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:12,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:12,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:12,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:12,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:12,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:12,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:12,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:12,271 INFO L87 Difference]: Start difference. First operand 11144 states and 17030 transitions. Second operand 3 states. [2018-11-28 12:13:12,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:12,468 INFO L93 Difference]: Finished difference Result 13196 states and 20872 transitions. [2018-11-28 12:13:12,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:12,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-28 12:13:12,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:12,494 INFO L225 Difference]: With dead ends: 13196 [2018-11-28 12:13:12,495 INFO L226 Difference]: Without dead ends: 13194 [2018-11-28 12:13:12,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:12,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13194 states. [2018-11-28 12:13:12,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13194 to 11144. [2018-11-28 12:13:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2018-11-28 12:13:12,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 16902 transitions. [2018-11-28 12:13:12,740 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 16902 transitions. Word has length 32 [2018-11-28 12:13:12,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:12,741 INFO L480 AbstractCegarLoop]: Abstraction has 11144 states and 16902 transitions. [2018-11-28 12:13:12,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:12,741 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 16902 transitions. [2018-11-28 12:13:12,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 12:13:12,749 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:12,749 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-11-28 12:13:12,749 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:12,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:12,750 INFO L82 PathProgramCache]: Analyzing trace with hash 699534184, now seen corresponding path program 1 times [2018-11-28 12:13:12,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:12,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:12,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:12,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:12,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:12,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:12,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:12,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:12,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:12,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:12,775 INFO L87 Difference]: Start difference. First operand 11144 states and 16902 transitions. Second operand 3 states. [2018-11-28 12:13:12,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:12,971 INFO L93 Difference]: Finished difference Result 19852 states and 30856 transitions. [2018-11-28 12:13:12,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:12,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-28 12:13:12,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:12,997 INFO L225 Difference]: With dead ends: 19852 [2018-11-28 12:13:12,997 INFO L226 Difference]: Without dead ends: 19850 [2018-11-28 12:13:13,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:13,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19850 states. [2018-11-28 12:13:13,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19850 to 16264. [2018-11-28 12:13:13,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16264 states. [2018-11-28 12:13:13,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16264 states to 16264 states and 23942 transitions. [2018-11-28 12:13:13,334 INFO L78 Accepts]: Start accepts. Automaton has 16264 states and 23942 transitions. Word has length 33 [2018-11-28 12:13:13,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:13,334 INFO L480 AbstractCegarLoop]: Abstraction has 16264 states and 23942 transitions. [2018-11-28 12:13:13,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:13,334 INFO L276 IsEmpty]: Start isEmpty. Operand 16264 states and 23942 transitions. [2018-11-28 12:13:13,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 12:13:13,348 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:13,348 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-11-28 12:13:13,348 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:13,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:13,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1294610522, now seen corresponding path program 1 times [2018-11-28 12:13:13,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:13,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:13,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:13,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:13,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:13,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-11-28 12:13:13,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:13,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:13,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:13,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:13,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:13,392 INFO L87 Difference]: Start difference. First operand 16264 states and 23942 transitions. Second operand 3 states. [2018-11-28 12:13:13,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:13,609 INFO L93 Difference]: Finished difference Result 38028 states and 56456 transitions. [2018-11-28 12:13:13,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:13,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-28 12:13:13,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:13,631 INFO L225 Difference]: With dead ends: 38028 [2018-11-28 12:13:13,631 INFO L226 Difference]: Without dead ends: 21898 [2018-11-28 12:13:13,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:13,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21898 states. [2018-11-28 12:13:14,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21898 to 21896. [2018-11-28 12:13:14,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21896 states. [2018-11-28 12:13:14,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21896 states to 21896 states and 32262 transitions. [2018-11-28 12:13:14,019 INFO L78 Accepts]: Start accepts. Automaton has 21896 states and 32262 transitions. Word has length 33 [2018-11-28 12:13:14,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:14,019 INFO L480 AbstractCegarLoop]: Abstraction has 21896 states and 32262 transitions. [2018-11-28 12:13:14,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:14,019 INFO L276 IsEmpty]: Start isEmpty. Operand 21896 states and 32262 transitions. [2018-11-28 12:13:14,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 12:13:14,028 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:14,028 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, 1] [2018-11-28 12:13:14,028 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:14,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:14,029 INFO L82 PathProgramCache]: Analyzing trace with hash 210937712, now seen corresponding path program 1 times [2018-11-28 12:13:14,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:14,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:14,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:14,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:14,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:14,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:14,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:14,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:14,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:14,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:14,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:14,051 INFO L87 Difference]: Start difference. First operand 21896 states and 32262 transitions. Second operand 3 states. [2018-11-28 12:13:14,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:14,214 INFO L93 Difference]: Finished difference Result 33036 states and 48648 transitions. [2018-11-28 12:13:14,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:14,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-28 12:13:14,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:14,232 INFO L225 Difference]: With dead ends: 33036 [2018-11-28 12:13:14,232 INFO L226 Difference]: Without dead ends: 22282 [2018-11-28 12:13:14,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:14,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22282 states. [2018-11-28 12:13:14,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22282 to 22280. [2018-11-28 12:13:14,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22280 states. [2018-11-28 12:13:14,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22280 states to 22280 states and 32518 transitions. [2018-11-28 12:13:14,521 INFO L78 Accepts]: Start accepts. Automaton has 22280 states and 32518 transitions. Word has length 34 [2018-11-28 12:13:14,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:14,521 INFO L480 AbstractCegarLoop]: Abstraction has 22280 states and 32518 transitions. [2018-11-28 12:13:14,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:14,521 INFO L276 IsEmpty]: Start isEmpty. Operand 22280 states and 32518 transitions. [2018-11-28 12:13:14,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 12:13:14,531 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:14,531 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, 1] [2018-11-28 12:13:14,531 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:14,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:14,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1478006030, now seen corresponding path program 1 times [2018-11-28 12:13:14,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:14,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:14,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:14,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:14,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:14,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:14,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:14,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:14,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:14,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:14,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:14,562 INFO L87 Difference]: Start difference. First operand 22280 states and 32518 transitions. Second operand 3 states. [2018-11-28 12:13:14,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:14,936 INFO L93 Difference]: Finished difference Result 38924 states and 58120 transitions. [2018-11-28 12:13:14,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:14,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-28 12:13:14,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:14,963 INFO L225 Difference]: With dead ends: 38924 [2018-11-28 12:13:14,963 INFO L226 Difference]: Without dead ends: 38922 [2018-11-28 12:13:14,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:14,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38922 states. [2018-11-28 12:13:15,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38922 to 32776. [2018-11-28 12:13:15,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32776 states. [2018-11-28 12:13:15,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32776 states to 32776 states and 46342 transitions. [2018-11-28 12:13:15,369 INFO L78 Accepts]: Start accepts. Automaton has 32776 states and 46342 transitions. Word has length 34 [2018-11-28 12:13:15,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:15,370 INFO L480 AbstractCegarLoop]: Abstraction has 32776 states and 46342 transitions. [2018-11-28 12:13:15,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:15,370 INFO L276 IsEmpty]: Start isEmpty. Operand 32776 states and 46342 transitions. [2018-11-28 12:13:15,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 12:13:15,387 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:15,387 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, 1] [2018-11-28 12:13:15,387 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:15,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:15,387 INFO L82 PathProgramCache]: Analyzing trace with hash 822816560, now seen corresponding path program 1 times [2018-11-28 12:13:15,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:15,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:15,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:15,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:15,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:15,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:15,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:15,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:15,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:15,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:15,417 INFO L87 Difference]: Start difference. First operand 32776 states and 46342 transitions. Second operand 3 states. [2018-11-28 12:13:15,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:15,994 INFO L93 Difference]: Finished difference Result 75788 states and 107784 transitions. [2018-11-28 12:13:15,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:15,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-28 12:13:15,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:16,024 INFO L225 Difference]: With dead ends: 75788 [2018-11-28 12:13:16,024 INFO L226 Difference]: Without dead ends: 43530 [2018-11-28 12:13:16,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:16,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43530 states. [2018-11-28 12:13:16,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43530 to 43528. [2018-11-28 12:13:16,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43528 states. [2018-11-28 12:13:16,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43528 states to 43528 states and 61446 transitions. [2018-11-28 12:13:16,537 INFO L78 Accepts]: Start accepts. Automaton has 43528 states and 61446 transitions. Word has length 34 [2018-11-28 12:13:16,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:16,537 INFO L480 AbstractCegarLoop]: Abstraction has 43528 states and 61446 transitions. [2018-11-28 12:13:16,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:16,537 INFO L276 IsEmpty]: Start isEmpty. Operand 43528 states and 61446 transitions. [2018-11-28 12:13:16,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 12:13:16,550 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:16,550 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, 1, 1] [2018-11-28 12:13:16,550 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:16,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:16,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1426668155, now seen corresponding path program 1 times [2018-11-28 12:13:16,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:16,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:16,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:16,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:16,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:16,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:16,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:16,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:16,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:16,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:16,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:16,579 INFO L87 Difference]: Start difference. First operand 43528 states and 61446 transitions. Second operand 3 states. [2018-11-28 12:13:17,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:17,065 INFO L93 Difference]: Finished difference Result 65292 states and 91912 transitions. [2018-11-28 12:13:17,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:17,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-28 12:13:17,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:17,095 INFO L225 Difference]: With dead ends: 65292 [2018-11-28 12:13:17,095 INFO L226 Difference]: Without dead ends: 44042 [2018-11-28 12:13:17,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:17,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44042 states. [2018-11-28 12:13:17,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44042 to 44040. [2018-11-28 12:13:17,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44040 states. [2018-11-28 12:13:17,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44040 states to 44040 states and 61446 transitions. [2018-11-28 12:13:17,664 INFO L78 Accepts]: Start accepts. Automaton has 44040 states and 61446 transitions. Word has length 35 [2018-11-28 12:13:17,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:17,664 INFO L480 AbstractCegarLoop]: Abstraction has 44040 states and 61446 transitions. [2018-11-28 12:13:17,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:17,664 INFO L276 IsEmpty]: Start isEmpty. Operand 44040 states and 61446 transitions. [2018-11-28 12:13:17,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 12:13:17,681 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:17,681 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, 1, 1] [2018-11-28 12:13:17,681 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:17,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:17,681 INFO L82 PathProgramCache]: Analyzing trace with hash -262275587, now seen corresponding path program 1 times [2018-11-28 12:13:17,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:17,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:17,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:17,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:17,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:17,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:17,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:17,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:17,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:17,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:17,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:17,710 INFO L87 Difference]: Start difference. First operand 44040 states and 61446 transitions. Second operand 3 states. [2018-11-28 12:13:18,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:18,519 INFO L93 Difference]: Finished difference Result 75788 states and 108040 transitions. [2018-11-28 12:13:18,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:18,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-28 12:13:18,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:18,569 INFO L225 Difference]: With dead ends: 75788 [2018-11-28 12:13:18,569 INFO L226 Difference]: Without dead ends: 75786 [2018-11-28 12:13:18,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:18,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75786 states. [2018-11-28 12:13:19,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75786 to 65544. [2018-11-28 12:13:19,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65544 states. [2018-11-28 12:13:19,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65544 states to 65544 states and 88582 transitions. [2018-11-28 12:13:19,325 INFO L78 Accepts]: Start accepts. Automaton has 65544 states and 88582 transitions. Word has length 35 [2018-11-28 12:13:19,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:19,325 INFO L480 AbstractCegarLoop]: Abstraction has 65544 states and 88582 transitions. [2018-11-28 12:13:19,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:19,325 INFO L276 IsEmpty]: Start isEmpty. Operand 65544 states and 88582 transitions. [2018-11-28 12:13:19,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 12:13:19,368 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:19,368 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, 1, 1] [2018-11-28 12:13:19,368 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:19,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:19,369 INFO L82 PathProgramCache]: Analyzing trace with hash 2038547003, now seen corresponding path program 1 times [2018-11-28 12:13:19,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:19,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:19,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:19,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:19,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:19,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:19,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:19,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:19,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:19,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:19,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:19,399 INFO L87 Difference]: Start difference. First operand 65544 states and 88582 transitions. Second operand 3 states. [2018-11-28 12:13:20,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:20,350 INFO L93 Difference]: Finished difference Result 150540 states and 204296 transitions. [2018-11-28 12:13:20,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:20,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-28 12:13:20,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:20,419 INFO L225 Difference]: With dead ends: 150540 [2018-11-28 12:13:20,419 INFO L226 Difference]: Without dead ends: 86026 [2018-11-28 12:13:20,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:20,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86026 states. [2018-11-28 12:13:21,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86026 to 86024. [2018-11-28 12:13:21,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86024 states. [2018-11-28 12:13:21,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86024 states to 86024 states and 115718 transitions. [2018-11-28 12:13:21,674 INFO L78 Accepts]: Start accepts. Automaton has 86024 states and 115718 transitions. Word has length 35 [2018-11-28 12:13:21,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:21,674 INFO L480 AbstractCegarLoop]: Abstraction has 86024 states and 115718 transitions. [2018-11-28 12:13:21,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:21,675 INFO L276 IsEmpty]: Start isEmpty. Operand 86024 states and 115718 transitions. [2018-11-28 12:13:21,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 12:13:21,718 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:21,718 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, 1, 1, 1] [2018-11-28 12:13:21,719 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:21,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:21,719 INFO L82 PathProgramCache]: Analyzing trace with hash 459606565, now seen corresponding path program 1 times [2018-11-28 12:13:21,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:21,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:21,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:21,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:21,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:21,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:21,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:21,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:21,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:21,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:21,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:21,752 INFO L87 Difference]: Start difference. First operand 86024 states and 115718 transitions. Second operand 3 states. [2018-11-28 12:13:22,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:22,688 INFO L93 Difference]: Finished difference Result 129036 states and 173064 transitions. [2018-11-28 12:13:22,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:22,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-28 12:13:22,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:22,760 INFO L225 Difference]: With dead ends: 129036 [2018-11-28 12:13:22,760 INFO L226 Difference]: Without dead ends: 87050 [2018-11-28 12:13:22,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:22,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87050 states. [2018-11-28 12:13:24,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87050 to 87048. [2018-11-28 12:13:24,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87048 states. [2018-11-28 12:13:24,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87048 states to 87048 states and 115718 transitions. [2018-11-28 12:13:24,285 INFO L78 Accepts]: Start accepts. Automaton has 87048 states and 115718 transitions. Word has length 36 [2018-11-28 12:13:24,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:24,285 INFO L480 AbstractCegarLoop]: Abstraction has 87048 states and 115718 transitions. [2018-11-28 12:13:24,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:24,285 INFO L276 IsEmpty]: Start isEmpty. Operand 87048 states and 115718 transitions. [2018-11-28 12:13:24,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 12:13:24,317 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:24,318 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, 1, 1, 1] [2018-11-28 12:13:24,318 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:24,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:24,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1229337177, now seen corresponding path program 1 times [2018-11-28 12:13:24,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:24,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:24,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:24,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:24,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:24,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:24,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:24,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:24,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:24,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:24,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:24,358 INFO L87 Difference]: Start difference. First operand 87048 states and 115718 transitions. Second operand 3 states. [2018-11-28 12:13:25,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:25,592 INFO L93 Difference]: Finished difference Result 147468 states and 199688 transitions. [2018-11-28 12:13:25,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:25,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-28 12:13:25,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:25,714 INFO L225 Difference]: With dead ends: 147468 [2018-11-28 12:13:25,714 INFO L226 Difference]: Without dead ends: 147466 [2018-11-28 12:13:25,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:25,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147466 states. [2018-11-28 12:13:27,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147466 to 131080. [2018-11-28 12:13:27,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131080 states. [2018-11-28 12:13:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131080 states to 131080 states and 168966 transitions. [2018-11-28 12:13:27,723 INFO L78 Accepts]: Start accepts. Automaton has 131080 states and 168966 transitions. Word has length 36 [2018-11-28 12:13:27,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:27,723 INFO L480 AbstractCegarLoop]: Abstraction has 131080 states and 168966 transitions. [2018-11-28 12:13:27,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:27,723 INFO L276 IsEmpty]: Start isEmpty. Operand 131080 states and 168966 transitions. [2018-11-28 12:13:27,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 12:13:27,778 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:27,778 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, 1, 1, 1] [2018-11-28 12:13:27,778 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:27,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:27,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1071485413, now seen corresponding path program 1 times [2018-11-28 12:13:27,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:27,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:27,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:27,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:27,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:27,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:27,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:27,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:27,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:27,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:27,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:27,806 INFO L87 Difference]: Start difference. First operand 131080 states and 168966 transitions. Second operand 3 states. [2018-11-28 12:13:29,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:29,653 INFO L93 Difference]: Finished difference Result 299020 states and 386056 transitions. [2018-11-28 12:13:29,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:29,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-28 12:13:29,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:29,816 INFO L225 Difference]: With dead ends: 299020 [2018-11-28 12:13:29,816 INFO L226 Difference]: Without dead ends: 169994 [2018-11-28 12:13:29,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:29,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169994 states. [2018-11-28 12:13:32,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169994 to 169992. [2018-11-28 12:13:32,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169992 states. [2018-11-28 12:13:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169992 states to 169992 states and 217094 transitions. [2018-11-28 12:13:32,728 INFO L78 Accepts]: Start accepts. Automaton has 169992 states and 217094 transitions. Word has length 36 [2018-11-28 12:13:32,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:32,728 INFO L480 AbstractCegarLoop]: Abstraction has 169992 states and 217094 transitions. [2018-11-28 12:13:32,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:32,728 INFO L276 IsEmpty]: Start isEmpty. Operand 169992 states and 217094 transitions. [2018-11-28 12:13:32,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 12:13:32,787 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:32,787 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, 1, 1, 1, 1] [2018-11-28 12:13:32,788 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:32,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:32,788 INFO L82 PathProgramCache]: Analyzing trace with hash 545468688, now seen corresponding path program 1 times [2018-11-28 12:13:32,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:32,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:32,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:32,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:32,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:32,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:32,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:32,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:32,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:32,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:32,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:32,810 INFO L87 Difference]: Start difference. First operand 169992 states and 217094 transitions. Second operand 3 states. [2018-11-28 12:13:36,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:36,383 INFO L93 Difference]: Finished difference Result 254988 states and 324616 transitions. [2018-11-28 12:13:36,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:36,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-28 12:13:36,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:36,524 INFO L225 Difference]: With dead ends: 254988 [2018-11-28 12:13:36,525 INFO L226 Difference]: Without dead ends: 172042 [2018-11-28 12:13:36,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:36,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172042 states. [2018-11-28 12:13:38,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172042 to 172040. [2018-11-28 12:13:38,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172040 states. [2018-11-28 12:13:39,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172040 states to 172040 states and 217094 transitions. [2018-11-28 12:13:39,057 INFO L78 Accepts]: Start accepts. Automaton has 172040 states and 217094 transitions. Word has length 37 [2018-11-28 12:13:39,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:39,057 INFO L480 AbstractCegarLoop]: Abstraction has 172040 states and 217094 transitions. [2018-11-28 12:13:39,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:39,058 INFO L276 IsEmpty]: Start isEmpty. Operand 172040 states and 217094 transitions. [2018-11-28 12:13:39,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 12:13:39,123 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:39,123 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, 1, 1, 1, 1] [2018-11-28 12:13:39,123 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:39,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:39,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1143475054, now seen corresponding path program 1 times [2018-11-28 12:13:39,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:39,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:39,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:39,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:39,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:39,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:39,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:39,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:39,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:39,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:39,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:39,139 INFO L87 Difference]: Start difference. First operand 172040 states and 217094 transitions. Second operand 3 states. [2018-11-28 12:13:42,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:42,062 INFO L93 Difference]: Finished difference Result 286732 states and 366600 transitions. [2018-11-28 12:13:42,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:42,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-28 12:13:42,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:42,291 INFO L225 Difference]: With dead ends: 286732 [2018-11-28 12:13:42,291 INFO L226 Difference]: Without dead ends: 286730 [2018-11-28 12:13:42,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-11-28 12:13:42,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286730 states. [2018-11-28 12:13:45,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286730 to 262152. [2018-11-28 12:13:45,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262152 states. [2018-11-28 12:13:45,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262152 states to 262152 states and 321542 transitions. [2018-11-28 12:13:45,916 INFO L78 Accepts]: Start accepts. Automaton has 262152 states and 321542 transitions. Word has length 37 [2018-11-28 12:13:45,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:45,916 INFO L480 AbstractCegarLoop]: Abstraction has 262152 states and 321542 transitions. [2018-11-28 12:13:45,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:45,916 INFO L276 IsEmpty]: Start isEmpty. Operand 262152 states and 321542 transitions. [2018-11-28 12:13:46,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 12:13:46,049 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:46,049 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, 1, 1, 1, 1] [2018-11-28 12:13:46,049 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:46,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:46,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1157347536, now seen corresponding path program 1 times [2018-11-28 12:13:46,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:46,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:46,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:46,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:46,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:46,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:46,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:46,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:46,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:46,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:46,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:46,075 INFO L87 Difference]: Start difference. First operand 262152 states and 321542 transitions. Second operand 3 states. [2018-11-28 12:13:49,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:13:49,579 INFO L93 Difference]: Finished difference Result 593932 states and 727048 transitions. [2018-11-28 12:13:49,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:13:49,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-28 12:13:49,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:13:49,920 INFO L225 Difference]: With dead ends: 593932 [2018-11-28 12:13:49,920 INFO L226 Difference]: Without dead ends: 335882 [2018-11-28 12:13:50,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:50,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335882 states. [2018-11-28 12:13:59,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335882 to 335880. [2018-11-28 12:13:59,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335880 states. [2018-11-28 12:13:59,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335880 states to 335880 states and 405510 transitions. [2018-11-28 12:13:59,495 INFO L78 Accepts]: Start accepts. Automaton has 335880 states and 405510 transitions. Word has length 37 [2018-11-28 12:13:59,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:13:59,495 INFO L480 AbstractCegarLoop]: Abstraction has 335880 states and 405510 transitions. [2018-11-28 12:13:59,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:13:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 335880 states and 405510 transitions. [2018-11-28 12:13:59,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-28 12:13:59,634 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:13:59,634 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, 1, 1, 1, 1, 1] [2018-11-28 12:13:59,635 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:13:59,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:13:59,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1087772454, now seen corresponding path program 1 times [2018-11-28 12:13:59,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:13:59,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:13:59,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:59,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:13:59,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:13:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:13:59,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:13:59,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:13:59,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:13:59,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:13:59,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:13:59,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:13:59,675 INFO L87 Difference]: Start difference. First operand 335880 states and 405510 transitions. Second operand 3 states. [2018-11-28 12:14:03,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:14:03,116 INFO L93 Difference]: Finished difference Result 503820 states and 606216 transitions. [2018-11-28 12:14:03,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:14:03,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-28 12:14:03,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:14:03,379 INFO L225 Difference]: With dead ends: 503820 [2018-11-28 12:14:03,379 INFO L226 Difference]: Without dead ends: 339978 [2018-11-28 12:14:03,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:14:03,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339978 states. [2018-11-28 12:14:08,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339978 to 339976. [2018-11-28 12:14:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339976 states. [2018-11-28 12:14:08,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339976 states to 339976 states and 405510 transitions. [2018-11-28 12:14:08,562 INFO L78 Accepts]: Start accepts. Automaton has 339976 states and 405510 transitions. Word has length 38 [2018-11-28 12:14:08,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:14:08,562 INFO L480 AbstractCegarLoop]: Abstraction has 339976 states and 405510 transitions. [2018-11-28 12:14:08,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:14:08,562 INFO L276 IsEmpty]: Start isEmpty. Operand 339976 states and 405510 transitions. [2018-11-28 12:14:08,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-28 12:14:08,690 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:14:08,691 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, 1, 1, 1, 1, 1] [2018-11-28 12:14:08,691 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:14:08,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:14:08,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1518251100, now seen corresponding path program 1 times [2018-11-28 12:14:08,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:14:08,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:14:08,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:14:08,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:14:08,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:14:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:14:08,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:14:08,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:14:08,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:14:08,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:14:08,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:14:08,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:14:08,723 INFO L87 Difference]: Start difference. First operand 339976 states and 405510 transitions. Second operand 3 states. [2018-11-28 12:14:14,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:14:14,330 INFO L93 Difference]: Finished difference Result 557068 states and 667656 transitions. [2018-11-28 12:14:14,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:14:14,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-28 12:14:14,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:14:14,825 INFO L225 Difference]: With dead ends: 557068 [2018-11-28 12:14:14,826 INFO L226 Difference]: Without dead ends: 557066 [2018-11-28 12:14:14,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:14:15,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557066 states. [2018-11-28 12:14:24,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557066 to 524296. [2018-11-28 12:14:24,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524296 states. [2018-11-28 12:14:25,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524296 states to 524296 states and 610310 transitions. [2018-11-28 12:14:25,227 INFO L78 Accepts]: Start accepts. Automaton has 524296 states and 610310 transitions. Word has length 38 [2018-11-28 12:14:25,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:14:25,228 INFO L480 AbstractCegarLoop]: Abstraction has 524296 states and 610310 transitions. [2018-11-28 12:14:25,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:14:25,228 INFO L276 IsEmpty]: Start isEmpty. Operand 524296 states and 610310 transitions. [2018-11-28 12:14:25,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-28 12:14:25,492 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:14:25,493 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, 1, 1, 1, 1, 1] [2018-11-28 12:14:25,493 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:14:25,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:14:25,493 INFO L82 PathProgramCache]: Analyzing trace with hash -475893606, now seen corresponding path program 1 times [2018-11-28 12:14:25,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:14:25,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:14:25,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:14:25,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:14:25,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:14:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:14:25,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:14:25,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:14:25,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:14:25,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:14:25,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:14:25,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:14:25,530 INFO L87 Difference]: Start difference. First operand 524296 states and 610310 transitions. Second operand 3 states. [2018-11-28 12:14:33,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:14:33,507 INFO L93 Difference]: Finished difference Result 1179660 states and 1363976 transitions. [2018-11-28 12:14:33,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:14:33,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-28 12:14:33,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:14:34,070 INFO L225 Difference]: With dead ends: 1179660 [2018-11-28 12:14:34,070 INFO L226 Difference]: Without dead ends: 663562 [2018-11-28 12:14:34,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:14:34,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663562 states. [2018-11-28 12:14:50,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663562 to 663560. [2018-11-28 12:14:50,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663560 states. [2018-11-28 12:14:51,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663560 states to 663560 states and 753670 transitions. [2018-11-28 12:14:51,885 INFO L78 Accepts]: Start accepts. Automaton has 663560 states and 753670 transitions. Word has length 38 [2018-11-28 12:14:51,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:14:51,886 INFO L480 AbstractCegarLoop]: Abstraction has 663560 states and 753670 transitions. [2018-11-28 12:14:51,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:14:51,886 INFO L276 IsEmpty]: Start isEmpty. Operand 663560 states and 753670 transitions. [2018-11-28 12:14:52,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 12:14:52,200 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:14:52,200 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, 1, 1, 1, 1, 1, 1] [2018-11-28 12:14:52,200 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:14:52,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:14:52,201 INFO L82 PathProgramCache]: Analyzing trace with hash -178639963, now seen corresponding path program 1 times [2018-11-28 12:14:52,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:14:52,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:14:52,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:14:52,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:14:52,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:14:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:14:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:14:52,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:14:52,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:14:52,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:14:52,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:14:52,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:14:52,232 INFO L87 Difference]: Start difference. First operand 663560 states and 753670 transitions. Second operand 3 states. [2018-11-28 12:15:00,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:15:00,065 INFO L93 Difference]: Finished difference Result 995340 states and 1126408 transitions. [2018-11-28 12:15:00,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:15:00,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-28 12:15:00,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:15:00,683 INFO L225 Difference]: With dead ends: 995340 [2018-11-28 12:15:00,683 INFO L226 Difference]: Without dead ends: 671754 [2018-11-28 12:15:00,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:15:01,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671754 states. [2018-11-28 12:15:16,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671754 to 671752. [2018-11-28 12:15:16,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671752 states. [2018-11-28 12:15:17,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671752 states to 671752 states and 753670 transitions. [2018-11-28 12:15:17,219 INFO L78 Accepts]: Start accepts. Automaton has 671752 states and 753670 transitions. Word has length 39 [2018-11-28 12:15:17,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:15:17,219 INFO L480 AbstractCegarLoop]: Abstraction has 671752 states and 753670 transitions. [2018-11-28 12:15:17,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:15:17,220 INFO L276 IsEmpty]: Start isEmpty. Operand 671752 states and 753670 transitions. [2018-11-28 12:15:17,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 12:15:17,459 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:15:17,459 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, 1, 1, 1, 1, 1, 1] [2018-11-28 12:15:17,459 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:15:17,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:17,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1867583705, now seen corresponding path program 1 times [2018-11-28 12:15:17,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:15:17,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:15:17,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:17,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:15:17,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:17,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:15:17,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:15:17,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:15:17,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:15:17,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:15:17,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:15:17,496 INFO L87 Difference]: Start difference. First operand 671752 states and 753670 transitions. Second operand 3 states. [2018-11-28 12:15:29,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:15:29,954 INFO L93 Difference]: Finished difference Result 1081354 states and 1204231 transitions. [2018-11-28 12:15:29,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:15:29,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-28 12:15:29,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:15:31,008 INFO L225 Difference]: With dead ends: 1081354 [2018-11-28 12:15:31,008 INFO L226 Difference]: Without dead ends: 1081352 [2018-11-28 12:15:31,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:15:31,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081352 states. [2018-11-28 12:15:45,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081352 to 1048584. [2018-11-28 12:15:45,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048584 states. [2018-11-28 12:15:46,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048584 states to 1048584 states and 1155078 transitions. [2018-11-28 12:15:46,281 INFO L78 Accepts]: Start accepts. Automaton has 1048584 states and 1155078 transitions. Word has length 39 [2018-11-28 12:15:46,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:15:46,281 INFO L480 AbstractCegarLoop]: Abstraction has 1048584 states and 1155078 transitions. [2018-11-28 12:15:46,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:15:46,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1048584 states and 1155078 transitions. [2018-11-28 12:15:54,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 12:15:54,768 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:15:54,769 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, 1, 1, 1, 1, 1, 1] [2018-11-28 12:15:54,769 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:15:54,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:15:54,769 INFO L82 PathProgramCache]: Analyzing trace with hash 433238885, now seen corresponding path program 1 times [2018-11-28 12:15:54,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:15:54,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:15:54,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:54,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:15:54,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:15:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:15:54,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:15:54,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:15:54,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:15:54,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:15:54,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:15:54,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:15:54,792 INFO L87 Difference]: Start difference. First operand 1048584 states and 1155078 transitions. Second operand 3 states. [2018-11-28 12:16:11,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:16:11,326 INFO L93 Difference]: Finished difference Result 2342920 states and 2547718 transitions. [2018-11-28 12:16:11,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:16:11,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-28 12:16:11,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:16:11,327 INFO L225 Difference]: With dead ends: 2342920 [2018-11-28 12:16:11,327 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 12:16:11,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:16:11,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 12:16:11,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 12:16:11,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 12:16:11,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 12:16:11,938 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-11-28 12:16:11,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:16:11,938 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:16:11,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:16:11,938 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:16:11,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 12:16:11,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 12:16:12,010 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 12:16:12,011 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 12:16:12,011 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 12:16:12,011 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 12:16:12,011 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 12:16:12,011 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 12:16:12,011 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 233) no Hoare annotation was computed. [2018-11-28 12:16:12,011 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-28 12:16:12,011 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,011 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,011 INFO L448 ceAbstractionStarter]: For program point L218-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,011 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,012 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-28 12:16:12,012 INFO L448 ceAbstractionStarter]: For program point L103-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,012 INFO L448 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2018-11-28 12:16:12,012 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,012 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 233) no Hoare annotation was computed. [2018-11-28 12:16:12,012 INFO L448 ceAbstractionStarter]: For program point L203-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,012 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-28 12:16:12,012 INFO L448 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-11-28 12:16:12,012 INFO L448 ceAbstractionStarter]: For program point L188-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,012 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-11-28 12:16:12,013 INFO L448 ceAbstractionStarter]: For program point L139-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,013 INFO L448 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-11-28 12:16:12,013 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,013 INFO L448 ceAbstractionStarter]: For program point L173-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,013 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,013 INFO L451 ceAbstractionStarter]: At program point L223-1(lines 54 228) the Hoare annotation is: true [2018-11-28 12:16:12,013 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2018-11-28 12:16:12,013 INFO L448 ceAbstractionStarter]: For program point L91-2(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,013 INFO L448 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-11-28 12:16:12,013 INFO L448 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2018-11-28 12:16:12,013 INFO L444 ceAbstractionStarter]: At program point L224-1(lines 5 233) the Hoare annotation is: false [2018-11-28 12:16:12,014 INFO L448 ceAbstractionStarter]: For program point L158-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,014 INFO L448 ceAbstractionStarter]: For program point L208-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,014 INFO L448 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-11-28 12:16:12,014 INFO L448 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2018-11-28 12:16:12,014 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,014 INFO L448 ceAbstractionStarter]: For program point L193-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,014 INFO L448 ceAbstractionStarter]: For program point L127-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,014 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,014 INFO L448 ceAbstractionStarter]: For program point L194(line 194) no Hoare annotation was computed. [2018-11-28 12:16:12,014 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,014 INFO L448 ceAbstractionStarter]: For program point L178-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,015 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 233) the Hoare annotation is: true [2018-11-28 12:16:12,015 INFO L448 ceAbstractionStarter]: For program point L179(line 179) no Hoare annotation was computed. [2018-11-28 12:16:12,015 INFO L451 ceAbstractionStarter]: At program point L229(lines 5 233) the Hoare annotation is: true [2018-11-28 12:16:12,015 INFO L448 ceAbstractionStarter]: For program point L163-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,015 INFO L448 ceAbstractionStarter]: For program point L213-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,015 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,015 INFO L448 ceAbstractionStarter]: For program point L164(line 164) no Hoare annotation was computed. [2018-11-28 12:16:12,015 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,015 INFO L448 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2018-11-28 12:16:12,015 INFO L448 ceAbstractionStarter]: For program point L115-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,015 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,016 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2018-11-28 12:16:12,016 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,016 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-28 12:16:12,016 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 54 228) no Hoare annotation was computed. [2018-11-28 12:16:12,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:16:12 BoogieIcfgContainer [2018-11-28 12:16:12,023 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 12:16:12,023 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:16:12,023 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:16:12,023 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:16:12,024 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:13:08" (3/4) ... [2018-11-28 12:16:12,028 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 12:16:12,035 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 12:16:12,035 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 12:16:12,041 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 12:16:12,042 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 12:16:12,042 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 12:16:12,106 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_49257edf-bc1c-4a08-9b5f-b98516f16b9c/bin-2019/uautomizer/witness.graphml [2018-11-28 12:16:12,106 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:16:12,107 INFO L168 Benchmark]: Toolchain (without parser) took 184087.73 ms. Allocated memory was 1.0 GB in the beginning and 8.4 GB in the end (delta: 7.3 GB). Free memory was 957.1 MB in the beginning and 3.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 5.0 GB. Max. memory is 11.5 GB. [2018-11-28 12:16:12,109 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:16:12,110 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.61 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:16:12,110 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-28 12:16:12,110 INFO L168 Benchmark]: Boogie Preprocessor took 28.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:16:12,111 INFO L168 Benchmark]: RCFGBuilder took 365.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2018-11-28 12:16:12,111 INFO L168 Benchmark]: TraceAbstraction took 183337.51 ms. Allocated memory was 1.2 GB in the beginning and 8.4 GB in the end (delta: 7.2 GB). Free memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 5.0 GB. Max. memory is 11.5 GB. [2018-11-28 12:16:12,111 INFO L168 Benchmark]: Witness Printer took 83.06 ms. Allocated memory is still 8.4 GB. Free memory was 3.3 GB in the beginning and 3.3 GB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-11-28 12:16:12,118 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 203.61 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 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 66.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 365.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 183337.51 ms. Allocated memory was 1.2 GB in the beginning and 8.4 GB in the end (delta: 7.2 GB). Free memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 5.0 GB. Max. memory is 11.5 GB. * Witness Printer took 83.06 ms. Allocated memory is still 8.4 GB. Free memory was 3.3 GB in the beginning and 3.3 GB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 231]: 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: 54]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 59 locations, 1 error locations. SAFE Result, 183.2s OverallTime, 43 OverallIterations, 1 TraceHistogramMax, 79.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5309 SDtfs, 2663 SDslu, 3669 SDs, 0 SdLazy, 229 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1048584occurred in iteration=42, 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: 92.0s AutomataMinimizationTime, 43 MinimizatonAttempts, 131120 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 32778 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1382 NumberOfCodeBlocks, 1382 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1339 ConstructedInterpolants, 0 QuantifiedInterpolants, 89720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 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...