./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_951d1cf8-2c69-4b4a-8a08-9587382caed9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_951d1cf8-2c69-4b4a-8a08-9587382caed9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_951d1cf8-2c69-4b4a-8a08-9587382caed9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_951d1cf8-2c69-4b4a-8a08-9587382caed9/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_951d1cf8-2c69-4b4a-8a08-9587382caed9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_951d1cf8-2c69-4b4a-8a08-9587382caed9/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 56f043bec3037ec37b4a132611abd4a337934428 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 07:53:15,375 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 07:53:15,376 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 07:53:15,382 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 07:53:15,382 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 07:53:15,383 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 07:53:15,383 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 07:53:15,384 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 07:53:15,385 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 07:53:15,385 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 07:53:15,386 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 07:53:15,386 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 07:53:15,386 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 07:53:15,387 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 07:53:15,388 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 07:53:15,388 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 07:53:15,388 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 07:53:15,389 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 07:53:15,390 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 07:53:15,391 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 07:53:15,392 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 07:53:15,392 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 07:53:15,393 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 07:53:15,394 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 07:53:15,394 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 07:53:15,394 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 07:53:15,395 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 07:53:15,395 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 07:53:15,396 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 07:53:15,396 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 07:53:15,396 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 07:53:15,397 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 07:53:15,397 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 07:53:15,397 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 07:53:15,397 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 07:53:15,398 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 07:53:15,398 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_951d1cf8-2c69-4b4a-8a08-9587382caed9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 07:53:15,405 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 07:53:15,406 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 07:53:15,406 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 07:53:15,406 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 07:53:15,406 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 07:53:15,407 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 07:53:15,407 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 07:53:15,407 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 07:53:15,407 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 07:53:15,407 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 07:53:15,407 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 07:53:15,407 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 07:53:15,407 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 07:53:15,407 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 07:53:15,407 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 07:53:15,407 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 07:53:15,408 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 07:53:15,408 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 07:53:15,408 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 07:53:15,408 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 07:53:15,408 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 07:53:15,408 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 07:53:15,408 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 07:53:15,408 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 07:53:15,408 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 07:53:15,408 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 07:53:15,408 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 07:53:15,409 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 07:53:15,409 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 07:53:15,409 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 07:53:15,409 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_951d1cf8-2c69-4b4a-8a08-9587382caed9/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 -> 56f043bec3037ec37b4a132611abd4a337934428 [2018-12-02 07:53:15,426 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 07:53:15,433 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 07:53:15,435 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 07:53:15,436 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 07:53:15,436 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 07:53:15,437 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_951d1cf8-2c69-4b4a-8a08-9587382caed9/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-02 07:53:15,470 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_951d1cf8-2c69-4b4a-8a08-9587382caed9/bin-2019/uautomizer/data/5ab6059bc/8e14e1cc30e542c2883edf181810fa5d/FLAGef910c591 [2018-12-02 07:53:15,902 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 07:53:15,903 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_951d1cf8-2c69-4b4a-8a08-9587382caed9/sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-02 07:53:15,907 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_951d1cf8-2c69-4b4a-8a08-9587382caed9/bin-2019/uautomizer/data/5ab6059bc/8e14e1cc30e542c2883edf181810fa5d/FLAGef910c591 [2018-12-02 07:53:15,915 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_951d1cf8-2c69-4b4a-8a08-9587382caed9/bin-2019/uautomizer/data/5ab6059bc/8e14e1cc30e542c2883edf181810fa5d [2018-12-02 07:53:15,917 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 07:53:15,917 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 07:53:15,918 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 07:53:15,918 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 07:53:15,920 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 07:53:15,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:53:15" (1/1) ... [2018-12-02 07:53:15,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2caf47c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:53:15, skipping insertion in model container [2018-12-02 07:53:15,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:53:15" (1/1) ... [2018-12-02 07:53:15,927 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 07:53:15,941 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 07:53:16,034 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:53:16,036 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 07:53:16,053 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:53:16,061 INFO L195 MainTranslator]: Completed translation [2018-12-02 07:53:16,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:53:16 WrapperNode [2018-12-02 07:53:16,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 07:53:16,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 07:53:16,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 07:53:16,062 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 07:53:16,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:53:16" (1/1) ... [2018-12-02 07:53:16,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:53:16" (1/1) ... [2018-12-02 07:53:16,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 07:53:16,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 07:53:16,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 07:53:16,074 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 07:53:16,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:53:16" (1/1) ... [2018-12-02 07:53:16,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:53:16" (1/1) ... [2018-12-02 07:53:16,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:53:16" (1/1) ... [2018-12-02 07:53:16,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:53:16" (1/1) ... [2018-12-02 07:53:16,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:53:16" (1/1) ... [2018-12-02 07:53:16,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:53:16" (1/1) ... [2018-12-02 07:53:16,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:53:16" (1/1) ... [2018-12-02 07:53:16,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 07:53:16,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 07:53:16,120 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 07:53:16,120 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 07:53:16,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:53:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_951d1cf8-2c69-4b4a-8a08-9587382caed9/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 07:53:16,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 07:53:16,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 07:53:16,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 07:53:16,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 07:53:16,151 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 07:53:16,151 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 07:53:16,298 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 07:53:16,298 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 07:53:16,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:53:16 BoogieIcfgContainer [2018-12-02 07:53:16,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 07:53:16,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 07:53:16,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 07:53:16,301 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 07:53:16,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:53:15" (1/3) ... [2018-12-02 07:53:16,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ffd3edf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:53:16, skipping insertion in model container [2018-12-02 07:53:16,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:53:16" (2/3) ... [2018-12-02 07:53:16,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ffd3edf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:53:16, skipping insertion in model container [2018-12-02 07:53:16,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:53:16" (3/3) ... [2018-12-02 07:53:16,303 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-02 07:53:16,309 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 07:53:16,314 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 07:53:16,324 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 07:53:16,342 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 07:53:16,342 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 07:53:16,342 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 07:53:16,342 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 07:53:16,342 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 07:53:16,342 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 07:53:16,342 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 07:53:16,342 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 07:53:16,343 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 07:53:16,353 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-12-02 07:53:16,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 07:53:16,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:16,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:16,359 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:16,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:16,362 INFO L82 PathProgramCache]: Analyzing trace with hash -316470182, now seen corresponding path program 1 times [2018-12-02 07:53:16,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:16,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:16,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:16,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:16,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:16,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:16,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:16,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:16,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:16,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:16,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:16,478 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2018-12-02 07:53:16,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:16,503 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2018-12-02 07:53:16,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:16,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 07:53:16,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:16,511 INFO L225 Difference]: With dead ends: 93 [2018-12-02 07:53:16,511 INFO L226 Difference]: Without dead ends: 78 [2018-12-02 07:53:16,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:16,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-02 07:53:16,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2018-12-02 07:53:16,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-02 07:53:16,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2018-12-02 07:53:16,537 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 21 [2018-12-02 07:53:16,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:16,537 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2018-12-02 07:53:16,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:16,537 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2018-12-02 07:53:16,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 07:53:16,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:16,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:16,538 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:16,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:16,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1327587432, now seen corresponding path program 1 times [2018-12-02 07:53:16,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:16,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:16,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:16,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:16,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:16,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:16,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:16,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:16,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:16,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:16,566 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2018-12-02 07:53:16,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:16,580 INFO L93 Difference]: Finished difference Result 127 states and 232 transitions. [2018-12-02 07:53:16,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:16,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 07:53:16,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:16,581 INFO L225 Difference]: With dead ends: 127 [2018-12-02 07:53:16,581 INFO L226 Difference]: Without dead ends: 78 [2018-12-02 07:53:16,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:16,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-02 07:53:16,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-12-02 07:53:16,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-02 07:53:16,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 137 transitions. [2018-12-02 07:53:16,587 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 137 transitions. Word has length 21 [2018-12-02 07:53:16,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:16,587 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 137 transitions. [2018-12-02 07:53:16,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:16,587 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 137 transitions. [2018-12-02 07:53:16,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 07:53:16,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:16,587 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:16,588 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:16,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:16,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1220427994, now seen corresponding path program 1 times [2018-12-02 07:53:16,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:16,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:16,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:16,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:16,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:16,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:16,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:16,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:16,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:16,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:16,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:16,609 INFO L87 Difference]: Start difference. First operand 76 states and 137 transitions. Second operand 3 states. [2018-12-02 07:53:16,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:16,623 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2018-12-02 07:53:16,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:16,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-02 07:53:16,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:16,624 INFO L225 Difference]: With dead ends: 117 [2018-12-02 07:53:16,624 INFO L226 Difference]: Without dead ends: 81 [2018-12-02 07:53:16,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:16,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-02 07:53:16,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-12-02 07:53:16,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-02 07:53:16,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 139 transitions. [2018-12-02 07:53:16,629 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 139 transitions. Word has length 22 [2018-12-02 07:53:16,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:16,629 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 139 transitions. [2018-12-02 07:53:16,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:16,629 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2018-12-02 07:53:16,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 07:53:16,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:16,630 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:16,630 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:16,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:16,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1794675624, now seen corresponding path program 1 times [2018-12-02 07:53:16,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:16,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:16,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:16,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:16,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:16,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:16,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:16,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:16,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:16,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:16,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:16,653 INFO L87 Difference]: Start difference. First operand 79 states and 139 transitions. Second operand 3 states. [2018-12-02 07:53:16,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:16,667 INFO L93 Difference]: Finished difference Result 148 states and 264 transitions. [2018-12-02 07:53:16,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:16,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-02 07:53:16,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:16,668 INFO L225 Difference]: With dead ends: 148 [2018-12-02 07:53:16,668 INFO L226 Difference]: Without dead ends: 146 [2018-12-02 07:53:16,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:16,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-02 07:53:16,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2018-12-02 07:53:16,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-02 07:53:16,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 184 transitions. [2018-12-02 07:53:16,673 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 184 transitions. Word has length 22 [2018-12-02 07:53:16,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:16,673 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 184 transitions. [2018-12-02 07:53:16,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:16,673 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 184 transitions. [2018-12-02 07:53:16,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 07:53:16,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:16,674 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:16,674 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:16,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:16,674 INFO L82 PathProgramCache]: Analyzing trace with hash 783558374, now seen corresponding path program 1 times [2018-12-02 07:53:16,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:16,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:16,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:16,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:16,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:16,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:16,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:16,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:16,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:16,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:16,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:16,693 INFO L87 Difference]: Start difference. First operand 104 states and 184 transitions. Second operand 3 states. [2018-12-02 07:53:16,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:16,711 INFO L93 Difference]: Finished difference Result 244 states and 438 transitions. [2018-12-02 07:53:16,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:16,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-02 07:53:16,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:16,713 INFO L225 Difference]: With dead ends: 244 [2018-12-02 07:53:16,713 INFO L226 Difference]: Without dead ends: 148 [2018-12-02 07:53:16,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:16,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-02 07:53:16,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-12-02 07:53:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-02 07:53:16,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 258 transitions. [2018-12-02 07:53:16,721 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 258 transitions. Word has length 22 [2018-12-02 07:53:16,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:16,722 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 258 transitions. [2018-12-02 07:53:16,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 258 transitions. [2018-12-02 07:53:16,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 07:53:16,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:16,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:16,723 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:16,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:16,723 INFO L82 PathProgramCache]: Analyzing trace with hash -199417107, now seen corresponding path program 1 times [2018-12-02 07:53:16,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:16,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:16,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:16,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:16,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:16,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:16,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:16,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:16,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:16,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:16,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:16,757 INFO L87 Difference]: Start difference. First operand 146 states and 258 transitions. Second operand 3 states. [2018-12-02 07:53:16,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:16,768 INFO L93 Difference]: Finished difference Result 219 states and 385 transitions. [2018-12-02 07:53:16,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:16,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 07:53:16,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:16,769 INFO L225 Difference]: With dead ends: 219 [2018-12-02 07:53:16,770 INFO L226 Difference]: Without dead ends: 150 [2018-12-02 07:53:16,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:16,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-02 07:53:16,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-12-02 07:53:16,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-02 07:53:16,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 258 transitions. [2018-12-02 07:53:16,777 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 258 transitions. Word has length 23 [2018-12-02 07:53:16,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:16,777 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 258 transitions. [2018-12-02 07:53:16,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:16,778 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 258 transitions. [2018-12-02 07:53:16,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 07:53:16,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:16,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] [2018-12-02 07:53:16,779 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:16,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:16,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1479280785, now seen corresponding path program 1 times [2018-12-02 07:53:16,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:16,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:16,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:16,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:16,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:16,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:16,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:16,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:16,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:16,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:16,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:16,802 INFO L87 Difference]: Start difference. First operand 148 states and 258 transitions. Second operand 3 states. [2018-12-02 07:53:16,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:16,816 INFO L93 Difference]: Finished difference Result 276 states and 488 transitions. [2018-12-02 07:53:16,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:16,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 07:53:16,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:16,817 INFO L225 Difference]: With dead ends: 276 [2018-12-02 07:53:16,817 INFO L226 Difference]: Without dead ends: 274 [2018-12-02 07:53:16,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:16,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-12-02 07:53:16,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 200. [2018-12-02 07:53:16,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-12-02 07:53:16,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 346 transitions. [2018-12-02 07:53:16,823 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 346 transitions. Word has length 23 [2018-12-02 07:53:16,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:16,823 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 346 transitions. [2018-12-02 07:53:16,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:16,823 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 346 transitions. [2018-12-02 07:53:16,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 07:53:16,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:16,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:16,824 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:16,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:16,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1804569261, now seen corresponding path program 1 times [2018-12-02 07:53:16,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:16,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:16,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:16,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:16,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:16,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:16,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:16,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:16,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:16,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:16,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:16,841 INFO L87 Difference]: Start difference. First operand 200 states and 346 transitions. Second operand 3 states. [2018-12-02 07:53:16,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:16,854 INFO L93 Difference]: Finished difference Result 472 states and 824 transitions. [2018-12-02 07:53:16,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:16,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 07:53:16,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:16,855 INFO L225 Difference]: With dead ends: 472 [2018-12-02 07:53:16,856 INFO L226 Difference]: Without dead ends: 282 [2018-12-02 07:53:16,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:16,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-02 07:53:16,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2018-12-02 07:53:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-12-02 07:53:16,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 482 transitions. [2018-12-02 07:53:16,866 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 482 transitions. Word has length 23 [2018-12-02 07:53:16,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:16,866 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 482 transitions. [2018-12-02 07:53:16,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:16,866 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 482 transitions. [2018-12-02 07:53:16,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 07:53:16,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:16,867 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:16,868 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:16,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:16,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1387149659, now seen corresponding path program 1 times [2018-12-02 07:53:16,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:16,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:16,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:16,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:16,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:16,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:16,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:16,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:16,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:16,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:16,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:16,890 INFO L87 Difference]: Start difference. First operand 280 states and 482 transitions. Second operand 3 states. [2018-12-02 07:53:16,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:16,905 INFO L93 Difference]: Finished difference Result 420 states and 720 transitions. [2018-12-02 07:53:16,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:16,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 07:53:16,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:16,907 INFO L225 Difference]: With dead ends: 420 [2018-12-02 07:53:16,907 INFO L226 Difference]: Without dead ends: 286 [2018-12-02 07:53:16,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:16,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-12-02 07:53:16,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2018-12-02 07:53:16,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-12-02 07:53:16,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 482 transitions. [2018-12-02 07:53:16,915 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 482 transitions. Word has length 24 [2018-12-02 07:53:16,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:16,915 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 482 transitions. [2018-12-02 07:53:16,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:16,915 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 482 transitions. [2018-12-02 07:53:16,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 07:53:16,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:16,916 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:16,917 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:16,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:16,917 INFO L82 PathProgramCache]: Analyzing trace with hash 107285981, now seen corresponding path program 1 times [2018-12-02 07:53:16,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:16,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:16,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:16,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:16,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:16,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:16,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:16,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:16,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:16,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:16,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:16,936 INFO L87 Difference]: Start difference. First operand 284 states and 482 transitions. Second operand 3 states. [2018-12-02 07:53:16,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:16,950 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2018-12-02 07:53:16,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:16,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 07:53:16,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:16,952 INFO L225 Difference]: With dead ends: 524 [2018-12-02 07:53:16,952 INFO L226 Difference]: Without dead ends: 522 [2018-12-02 07:53:16,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:16,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-12-02 07:53:16,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 392. [2018-12-02 07:53:16,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-12-02 07:53:16,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 654 transitions. [2018-12-02 07:53:16,963 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 654 transitions. Word has length 24 [2018-12-02 07:53:16,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:16,963 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 654 transitions. [2018-12-02 07:53:16,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:16,963 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 654 transitions. [2018-12-02 07:53:16,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 07:53:16,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:16,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:16,964 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:16,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:16,964 INFO L82 PathProgramCache]: Analyzing trace with hash -903831269, now seen corresponding path program 1 times [2018-12-02 07:53:16,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:16,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:16,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:16,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:16,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:16,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:16,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:16,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:16,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:16,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:16,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:16,976 INFO L87 Difference]: Start difference. First operand 392 states and 654 transitions. Second operand 3 states. [2018-12-02 07:53:16,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:16,990 INFO L93 Difference]: Finished difference Result 924 states and 1552 transitions. [2018-12-02 07:53:16,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:16,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 07:53:16,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:16,991 INFO L225 Difference]: With dead ends: 924 [2018-12-02 07:53:16,991 INFO L226 Difference]: Without dead ends: 546 [2018-12-02 07:53:16,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:16,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-12-02 07:53:17,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2018-12-02 07:53:17,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-12-02 07:53:17,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 902 transitions. [2018-12-02 07:53:17,002 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 902 transitions. Word has length 24 [2018-12-02 07:53:17,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:17,002 INFO L480 AbstractCegarLoop]: Abstraction has 544 states and 902 transitions. [2018-12-02 07:53:17,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:17,003 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 902 transitions. [2018-12-02 07:53:17,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 07:53:17,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:17,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:17,003 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:17,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:17,004 INFO L82 PathProgramCache]: Analyzing trace with hash -968887806, now seen corresponding path program 1 times [2018-12-02 07:53:17,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:17,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:17,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:17,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:17,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:17,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:17,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:17,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:17,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:17,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:17,015 INFO L87 Difference]: Start difference. First operand 544 states and 902 transitions. Second operand 3 states. [2018-12-02 07:53:17,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:17,028 INFO L93 Difference]: Finished difference Result 816 states and 1348 transitions. [2018-12-02 07:53:17,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:17,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 07:53:17,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:17,029 INFO L225 Difference]: With dead ends: 816 [2018-12-02 07:53:17,030 INFO L226 Difference]: Without dead ends: 554 [2018-12-02 07:53:17,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:17,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-12-02 07:53:17,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2018-12-02 07:53:17,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-12-02 07:53:17,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 902 transitions. [2018-12-02 07:53:17,040 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 902 transitions. Word has length 25 [2018-12-02 07:53:17,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:17,041 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 902 transitions. [2018-12-02 07:53:17,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:17,041 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 902 transitions. [2018-12-02 07:53:17,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 07:53:17,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:17,042 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:17,042 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:17,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:17,042 INFO L82 PathProgramCache]: Analyzing trace with hash 2046215812, now seen corresponding path program 1 times [2018-12-02 07:53:17,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:17,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:17,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:17,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:17,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:17,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:17,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:17,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:17,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:17,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:17,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:17,053 INFO L87 Difference]: Start difference. First operand 552 states and 902 transitions. Second operand 3 states. [2018-12-02 07:53:17,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:17,068 INFO L93 Difference]: Finished difference Result 1004 states and 1672 transitions. [2018-12-02 07:53:17,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:17,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 07:53:17,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:17,071 INFO L225 Difference]: With dead ends: 1004 [2018-12-02 07:53:17,071 INFO L226 Difference]: Without dead ends: 1002 [2018-12-02 07:53:17,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:17,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2018-12-02 07:53:17,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 776. [2018-12-02 07:53:17,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-12-02 07:53:17,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1238 transitions. [2018-12-02 07:53:17,085 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1238 transitions. Word has length 25 [2018-12-02 07:53:17,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:17,085 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 1238 transitions. [2018-12-02 07:53:17,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:17,085 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1238 transitions. [2018-12-02 07:53:17,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 07:53:17,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:17,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:17,086 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:17,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:17,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1035098562, now seen corresponding path program 1 times [2018-12-02 07:53:17,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:17,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:17,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:17,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:17,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:17,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:17,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:17,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:17,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:17,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:17,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:17,097 INFO L87 Difference]: Start difference. First operand 776 states and 1238 transitions. Second operand 3 states. [2018-12-02 07:53:17,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:17,122 INFO L93 Difference]: Finished difference Result 1820 states and 2920 transitions. [2018-12-02 07:53:17,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:17,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 07:53:17,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:17,125 INFO L225 Difference]: With dead ends: 1820 [2018-12-02 07:53:17,125 INFO L226 Difference]: Without dead ends: 1066 [2018-12-02 07:53:17,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-12-02 07:53:17,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2018-12-02 07:53:17,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1064. [2018-12-02 07:53:17,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2018-12-02 07:53:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1686 transitions. [2018-12-02 07:53:17,149 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1686 transitions. Word has length 25 [2018-12-02 07:53:17,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:17,149 INFO L480 AbstractCegarLoop]: Abstraction has 1064 states and 1686 transitions. [2018-12-02 07:53:17,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:17,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1686 transitions. [2018-12-02 07:53:17,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 07:53:17,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:17,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:17,150 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:17,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:17,151 INFO L82 PathProgramCache]: Analyzing trace with hash -991604848, now seen corresponding path program 1 times [2018-12-02 07:53:17,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:17,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:17,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:17,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:17,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:17,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:17,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:17,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:17,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:17,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:17,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:17,162 INFO L87 Difference]: Start difference. First operand 1064 states and 1686 transitions. Second operand 3 states. [2018-12-02 07:53:17,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:17,179 INFO L93 Difference]: Finished difference Result 1596 states and 2520 transitions. [2018-12-02 07:53:17,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:17,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-02 07:53:17,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:17,181 INFO L225 Difference]: With dead ends: 1596 [2018-12-02 07:53:17,181 INFO L226 Difference]: Without dead ends: 1082 [2018-12-02 07:53:17,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:17,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2018-12-02 07:53:17,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1080. [2018-12-02 07:53:17,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-12-02 07:53:17,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1686 transitions. [2018-12-02 07:53:17,201 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1686 transitions. Word has length 26 [2018-12-02 07:53:17,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:17,201 INFO L480 AbstractCegarLoop]: Abstraction has 1080 states and 1686 transitions. [2018-12-02 07:53:17,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:17,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1686 transitions. [2018-12-02 07:53:17,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 07:53:17,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:17,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:17,203 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:17,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:17,203 INFO L82 PathProgramCache]: Analyzing trace with hash 2023498770, now seen corresponding path program 1 times [2018-12-02 07:53:17,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:17,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:17,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:17,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:17,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:17,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:17,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:17,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:17,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:17,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:17,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:17,213 INFO L87 Difference]: Start difference. First operand 1080 states and 1686 transitions. Second operand 3 states. [2018-12-02 07:53:17,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:17,251 INFO L93 Difference]: Finished difference Result 1932 states and 3080 transitions. [2018-12-02 07:53:17,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:17,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-02 07:53:17,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:17,256 INFO L225 Difference]: With dead ends: 1932 [2018-12-02 07:53:17,256 INFO L226 Difference]: Without dead ends: 1930 [2018-12-02 07:53:17,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:17,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2018-12-02 07:53:17,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1544. [2018-12-02 07:53:17,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2018-12-02 07:53:17,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2342 transitions. [2018-12-02 07:53:17,284 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2342 transitions. Word has length 26 [2018-12-02 07:53:17,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:17,285 INFO L480 AbstractCegarLoop]: Abstraction has 1544 states and 2342 transitions. [2018-12-02 07:53:17,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:17,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2342 transitions. [2018-12-02 07:53:17,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 07:53:17,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:17,286 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:17,286 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:17,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:17,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1012381520, now seen corresponding path program 1 times [2018-12-02 07:53:17,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:17,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:17,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:17,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:17,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:17,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:17,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:17,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:17,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:17,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:17,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:17,300 INFO L87 Difference]: Start difference. First operand 1544 states and 2342 transitions. Second operand 3 states. [2018-12-02 07:53:17,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:17,348 INFO L93 Difference]: Finished difference Result 3596 states and 5480 transitions. [2018-12-02 07:53:17,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:17,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-02 07:53:17,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:17,354 INFO L225 Difference]: With dead ends: 3596 [2018-12-02 07:53:17,354 INFO L226 Difference]: Without dead ends: 2090 [2018-12-02 07:53:17,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:17,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2018-12-02 07:53:17,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2088. [2018-12-02 07:53:17,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2018-12-02 07:53:17,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3142 transitions. [2018-12-02 07:53:17,397 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3142 transitions. Word has length 26 [2018-12-02 07:53:17,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:17,398 INFO L480 AbstractCegarLoop]: Abstraction has 2088 states and 3142 transitions. [2018-12-02 07:53:17,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:17,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3142 transitions. [2018-12-02 07:53:17,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 07:53:17,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:17,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:17,399 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:17,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:17,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1695832809, now seen corresponding path program 1 times [2018-12-02 07:53:17,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:17,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:17,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:17,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:17,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:17,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:17,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:17,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:17,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:17,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:17,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:17,413 INFO L87 Difference]: Start difference. First operand 2088 states and 3142 transitions. Second operand 3 states. [2018-12-02 07:53:17,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:17,459 INFO L93 Difference]: Finished difference Result 3132 states and 4696 transitions. [2018-12-02 07:53:17,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:17,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-02 07:53:17,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:17,463 INFO L225 Difference]: With dead ends: 3132 [2018-12-02 07:53:17,464 INFO L226 Difference]: Without dead ends: 2122 [2018-12-02 07:53:17,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:17,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2018-12-02 07:53:17,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2120. [2018-12-02 07:53:17,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2018-12-02 07:53:17,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 3142 transitions. [2018-12-02 07:53:17,510 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 3142 transitions. Word has length 27 [2018-12-02 07:53:17,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:17,510 INFO L480 AbstractCegarLoop]: Abstraction has 2120 states and 3142 transitions. [2018-12-02 07:53:17,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:17,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 3142 transitions. [2018-12-02 07:53:17,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 07:53:17,511 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:17,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:17,511 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:17,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:17,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1319270809, now seen corresponding path program 1 times [2018-12-02 07:53:17,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:17,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:17,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:17,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:17,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:17,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:17,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:17,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:17,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:17,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:17,525 INFO L87 Difference]: Start difference. First operand 2120 states and 3142 transitions. Second operand 3 states. [2018-12-02 07:53:17,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:17,563 INFO L93 Difference]: Finished difference Result 3724 states and 5640 transitions. [2018-12-02 07:53:17,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:17,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-02 07:53:17,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:17,569 INFO L225 Difference]: With dead ends: 3724 [2018-12-02 07:53:17,569 INFO L226 Difference]: Without dead ends: 3722 [2018-12-02 07:53:17,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-12-02 07:53:17,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2018-12-02 07:53:17,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3080. [2018-12-02 07:53:17,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2018-12-02 07:53:17,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4422 transitions. [2018-12-02 07:53:17,616 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4422 transitions. Word has length 27 [2018-12-02 07:53:17,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:17,616 INFO L480 AbstractCegarLoop]: Abstraction has 3080 states and 4422 transitions. [2018-12-02 07:53:17,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:17,616 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4422 transitions. [2018-12-02 07:53:17,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 07:53:17,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:17,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:17,618 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:17,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:17,619 INFO L82 PathProgramCache]: Analyzing trace with hash 308153559, now seen corresponding path program 1 times [2018-12-02 07:53:17,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:17,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:17,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:17,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:17,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:17,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:17,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:17,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:17,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:17,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:17,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:17,629 INFO L87 Difference]: Start difference. First operand 3080 states and 4422 transitions. Second operand 3 states. [2018-12-02 07:53:17,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:17,678 INFO L93 Difference]: Finished difference Result 7116 states and 10248 transitions. [2018-12-02 07:53:17,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:17,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-02 07:53:17,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:17,684 INFO L225 Difference]: With dead ends: 7116 [2018-12-02 07:53:17,684 INFO L226 Difference]: Without dead ends: 4106 [2018-12-02 07:53:17,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:17,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2018-12-02 07:53:17,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4104. [2018-12-02 07:53:17,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2018-12-02 07:53:17,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 5830 transitions. [2018-12-02 07:53:17,756 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 5830 transitions. Word has length 27 [2018-12-02 07:53:17,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:17,756 INFO L480 AbstractCegarLoop]: Abstraction has 4104 states and 5830 transitions. [2018-12-02 07:53:17,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:17,756 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 5830 transitions. [2018-12-02 07:53:17,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 07:53:17,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:17,758 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:17,759 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:17,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:17,759 INFO L82 PathProgramCache]: Analyzing trace with hash -2052062779, now seen corresponding path program 1 times [2018-12-02 07:53:17,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:17,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:17,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:17,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:17,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:17,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:17,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:17,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:17,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:17,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:17,772 INFO L87 Difference]: Start difference. First operand 4104 states and 5830 transitions. Second operand 3 states. [2018-12-02 07:53:17,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:17,817 INFO L93 Difference]: Finished difference Result 6156 states and 8712 transitions. [2018-12-02 07:53:17,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:17,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-02 07:53:17,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:17,827 INFO L225 Difference]: With dead ends: 6156 [2018-12-02 07:53:17,828 INFO L226 Difference]: Without dead ends: 4170 [2018-12-02 07:53:17,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:17,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2018-12-02 07:53:17,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4168. [2018-12-02 07:53:17,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4168 states. [2018-12-02 07:53:17,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5830 transitions. [2018-12-02 07:53:17,900 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5830 transitions. Word has length 28 [2018-12-02 07:53:17,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:17,900 INFO L480 AbstractCegarLoop]: Abstraction has 4168 states and 5830 transitions. [2018-12-02 07:53:17,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:17,900 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5830 transitions. [2018-12-02 07:53:17,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 07:53:17,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:17,902 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:17,902 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:17,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:17,902 INFO L82 PathProgramCache]: Analyzing trace with hash 963040839, now seen corresponding path program 1 times [2018-12-02 07:53:17,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:17,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:17,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:17,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:17,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:17,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:17,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:17,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:17,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:17,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:17,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:17,916 INFO L87 Difference]: Start difference. First operand 4168 states and 5830 transitions. Second operand 3 states. [2018-12-02 07:53:17,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:17,986 INFO L93 Difference]: Finished difference Result 12108 states and 16712 transitions. [2018-12-02 07:53:17,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:17,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-02 07:53:17,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:17,998 INFO L225 Difference]: With dead ends: 12108 [2018-12-02 07:53:17,998 INFO L226 Difference]: Without dead ends: 8074 [2018-12-02 07:53:18,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-12-02 07:53:18,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2018-12-02 07:53:18,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 8072. [2018-12-02 07:53:18,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2018-12-02 07:53:18,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10886 transitions. [2018-12-02 07:53:18,153 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10886 transitions. Word has length 28 [2018-12-02 07:53:18,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:18,153 INFO L480 AbstractCegarLoop]: Abstraction has 8072 states and 10886 transitions. [2018-12-02 07:53:18,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:18,153 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10886 transitions. [2018-12-02 07:53:18,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 07:53:18,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:18,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:18,159 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:18,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:18,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1974158089, now seen corresponding path program 1 times [2018-12-02 07:53:18,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:18,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:18,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:18,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:18,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:18,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:18,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:18,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:18,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:18,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:18,173 INFO L87 Difference]: Start difference. First operand 8072 states and 10886 transitions. Second operand 3 states. [2018-12-02 07:53:18,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:18,325 INFO L93 Difference]: Finished difference Result 9100 states and 12680 transitions. [2018-12-02 07:53:18,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:18,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-02 07:53:18,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:18,340 INFO L225 Difference]: With dead ends: 9100 [2018-12-02 07:53:18,340 INFO L226 Difference]: Without dead ends: 9098 [2018-12-02 07:53:18,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:18,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states. [2018-12-02 07:53:18,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 8072. [2018-12-02 07:53:18,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2018-12-02 07:53:18,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10758 transitions. [2018-12-02 07:53:18,451 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10758 transitions. Word has length 28 [2018-12-02 07:53:18,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:18,451 INFO L480 AbstractCegarLoop]: Abstraction has 8072 states and 10758 transitions. [2018-12-02 07:53:18,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:18,451 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10758 transitions. [2018-12-02 07:53:18,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 07:53:18,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:18,455 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:18,455 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:18,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:18,456 INFO L82 PathProgramCache]: Analyzing trace with hash -210289620, now seen corresponding path program 1 times [2018-12-02 07:53:18,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:18,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:18,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:18,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:18,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:18,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:18,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:18,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:18,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:18,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:18,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:18,468 INFO L87 Difference]: Start difference. First operand 8072 states and 10758 transitions. Second operand 3 states. [2018-12-02 07:53:18,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:18,566 INFO L93 Difference]: Finished difference Result 13708 states and 18568 transitions. [2018-12-02 07:53:18,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:18,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-02 07:53:18,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:18,579 INFO L225 Difference]: With dead ends: 13708 [2018-12-02 07:53:18,579 INFO L226 Difference]: Without dead ends: 13706 [2018-12-02 07:53:18,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:18,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13706 states. [2018-12-02 07:53:18,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13706 to 12168. [2018-12-02 07:53:18,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12168 states. [2018-12-02 07:53:18,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12168 states to 12168 states and 15750 transitions. [2018-12-02 07:53:18,702 INFO L78 Accepts]: Start accepts. Automaton has 12168 states and 15750 transitions. Word has length 29 [2018-12-02 07:53:18,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:18,703 INFO L480 AbstractCegarLoop]: Abstraction has 12168 states and 15750 transitions. [2018-12-02 07:53:18,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:18,703 INFO L276 IsEmpty]: Start isEmpty. Operand 12168 states and 15750 transitions. [2018-12-02 07:53:18,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 07:53:18,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:18,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:18,709 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:18,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:18,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1221406870, now seen corresponding path program 1 times [2018-12-02 07:53:18,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:18,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:18,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:18,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:18,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:18,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:18,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:18,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:18,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:18,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:18,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:18,719 INFO L87 Difference]: Start difference. First operand 12168 states and 15750 transitions. Second operand 3 states. [2018-12-02 07:53:18,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:18,863 INFO L93 Difference]: Finished difference Result 27788 states and 35976 transitions. [2018-12-02 07:53:18,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:18,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-02 07:53:18,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:18,876 INFO L225 Difference]: With dead ends: 27788 [2018-12-02 07:53:18,876 INFO L226 Difference]: Without dead ends: 15754 [2018-12-02 07:53:18,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:18,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15754 states. [2018-12-02 07:53:19,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15754 to 15752. [2018-12-02 07:53:19,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15752 states. [2018-12-02 07:53:19,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15752 states to 15752 states and 19974 transitions. [2018-12-02 07:53:19,111 INFO L78 Accepts]: Start accepts. Automaton has 15752 states and 19974 transitions. Word has length 29 [2018-12-02 07:53:19,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:19,111 INFO L480 AbstractCegarLoop]: Abstraction has 15752 states and 19974 transitions. [2018-12-02 07:53:19,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:19,111 INFO L276 IsEmpty]: Start isEmpty. Operand 15752 states and 19974 transitions. [2018-12-02 07:53:19,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 07:53:19,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:19,116 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:19,116 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:19,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:19,117 INFO L82 PathProgramCache]: Analyzing trace with hash 2071172156, now seen corresponding path program 1 times [2018-12-02 07:53:19,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:19,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:19,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:19,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:19,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:19,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:19,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:19,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:19,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:19,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:19,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:19,128 INFO L87 Difference]: Start difference. First operand 15752 states and 19974 transitions. Second operand 3 states. [2018-12-02 07:53:19,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:19,244 INFO L93 Difference]: Finished difference Result 23820 states and 30216 transitions. [2018-12-02 07:53:19,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:19,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-02 07:53:19,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:19,256 INFO L225 Difference]: With dead ends: 23820 [2018-12-02 07:53:19,256 INFO L226 Difference]: Without dead ends: 16138 [2018-12-02 07:53:19,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:19,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16138 states. [2018-12-02 07:53:19,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16138 to 16136. [2018-12-02 07:53:19,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16136 states. [2018-12-02 07:53:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 20230 transitions. [2018-12-02 07:53:19,442 INFO L78 Accepts]: Start accepts. Automaton has 16136 states and 20230 transitions. Word has length 30 [2018-12-02 07:53:19,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:19,442 INFO L480 AbstractCegarLoop]: Abstraction has 16136 states and 20230 transitions. [2018-12-02 07:53:19,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:19,442 INFO L276 IsEmpty]: Start isEmpty. Operand 16136 states and 20230 transitions. [2018-12-02 07:53:19,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 07:53:19,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:19,447 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:19,448 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:19,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:19,448 INFO L82 PathProgramCache]: Analyzing trace with hash 791308478, now seen corresponding path program 1 times [2018-12-02 07:53:19,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:19,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:19,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:19,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:19,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:19,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:19,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:19,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:19,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:19,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:19,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:19,466 INFO L87 Difference]: Start difference. First operand 16136 states and 20230 transitions. Second operand 3 states. [2018-12-02 07:53:19,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:19,690 INFO L93 Difference]: Finished difference Result 26636 states and 33544 transitions. [2018-12-02 07:53:19,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:19,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-02 07:53:19,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:19,705 INFO L225 Difference]: With dead ends: 26636 [2018-12-02 07:53:19,705 INFO L226 Difference]: Without dead ends: 26634 [2018-12-02 07:53:19,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:19,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26634 states. [2018-12-02 07:53:19,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26634 to 24584. [2018-12-02 07:53:19,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24584 states. [2018-12-02 07:53:19,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24584 states to 24584 states and 29958 transitions. [2018-12-02 07:53:19,959 INFO L78 Accepts]: Start accepts. Automaton has 24584 states and 29958 transitions. Word has length 30 [2018-12-02 07:53:19,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:19,959 INFO L480 AbstractCegarLoop]: Abstraction has 24584 states and 29958 transitions. [2018-12-02 07:53:19,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:19,959 INFO L276 IsEmpty]: Start isEmpty. Operand 24584 states and 29958 transitions. [2018-12-02 07:53:19,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 07:53:19,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:19,971 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:19,971 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:19,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:19,971 INFO L82 PathProgramCache]: Analyzing trace with hash -219808772, now seen corresponding path program 1 times [2018-12-02 07:53:19,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:19,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:19,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:19,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:19,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:19,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:19,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:19,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:19,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:19,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:19,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:19,983 INFO L87 Difference]: Start difference. First operand 24584 states and 29958 transitions. Second operand 3 states. [2018-12-02 07:53:20,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:20,254 INFO L93 Difference]: Finished difference Result 55308 states and 66824 transitions. [2018-12-02 07:53:20,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:20,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-02 07:53:20,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:20,280 INFO L225 Difference]: With dead ends: 55308 [2018-12-02 07:53:20,280 INFO L226 Difference]: Without dead ends: 31242 [2018-12-02 07:53:20,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:20,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31242 states. [2018-12-02 07:53:20,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31242 to 31240. [2018-12-02 07:53:20,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31240 states. [2018-12-02 07:53:20,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31240 states to 31240 states and 36870 transitions. [2018-12-02 07:53:20,737 INFO L78 Accepts]: Start accepts. Automaton has 31240 states and 36870 transitions. Word has length 30 [2018-12-02 07:53:20,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:20,737 INFO L480 AbstractCegarLoop]: Abstraction has 31240 states and 36870 transitions. [2018-12-02 07:53:20,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:20,737 INFO L276 IsEmpty]: Start isEmpty. Operand 31240 states and 36870 transitions. [2018-12-02 07:53:20,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 07:53:20,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:20,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:20,748 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:20,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:20,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1239024833, now seen corresponding path program 1 times [2018-12-02 07:53:20,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:20,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:20,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:20,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:20,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:20,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:20,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:20,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:20,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:20,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:20,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:20,760 INFO L87 Difference]: Start difference. First operand 31240 states and 36870 transitions. Second operand 3 states. [2018-12-02 07:53:21,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:21,010 INFO L93 Difference]: Finished difference Result 46860 states and 55048 transitions. [2018-12-02 07:53:21,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:21,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-02 07:53:21,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:21,030 INFO L225 Difference]: With dead ends: 46860 [2018-12-02 07:53:21,030 INFO L226 Difference]: Without dead ends: 31754 [2018-12-02 07:53:21,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:21,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31754 states. [2018-12-02 07:53:21,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31754 to 31752. [2018-12-02 07:53:21,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31752 states. [2018-12-02 07:53:21,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31752 states to 31752 states and 36870 transitions. [2018-12-02 07:53:21,483 INFO L78 Accepts]: Start accepts. Automaton has 31752 states and 36870 transitions. Word has length 31 [2018-12-02 07:53:21,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:21,484 INFO L480 AbstractCegarLoop]: Abstraction has 31752 states and 36870 transitions. [2018-12-02 07:53:21,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:21,484 INFO L276 IsEmpty]: Start isEmpty. Operand 31752 states and 36870 transitions. [2018-12-02 07:53:21,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 07:53:21,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:21,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] [2018-12-02 07:53:21,493 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:21,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:21,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1776078785, now seen corresponding path program 1 times [2018-12-02 07:53:21,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:21,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:21,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:21,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:21,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:21,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:21,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:21,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:21,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:21,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:21,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:21,512 INFO L87 Difference]: Start difference. First operand 31752 states and 36870 transitions. Second operand 3 states. [2018-12-02 07:53:21,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:21,938 INFO L93 Difference]: Finished difference Result 51210 states and 58887 transitions. [2018-12-02 07:53:21,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:21,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-02 07:53:21,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:21,970 INFO L225 Difference]: With dead ends: 51210 [2018-12-02 07:53:21,971 INFO L226 Difference]: Without dead ends: 51208 [2018-12-02 07:53:21,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:22,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51208 states. [2018-12-02 07:53:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51208 to 49160. [2018-12-02 07:53:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49160 states. [2018-12-02 07:53:22,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49160 states to 49160 states and 55814 transitions. [2018-12-02 07:53:22,643 INFO L78 Accepts]: Start accepts. Automaton has 49160 states and 55814 transitions. Word has length 31 [2018-12-02 07:53:22,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:22,643 INFO L480 AbstractCegarLoop]: Abstraction has 49160 states and 55814 transitions. [2018-12-02 07:53:22,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:22,643 INFO L276 IsEmpty]: Start isEmpty. Operand 49160 states and 55814 transitions. [2018-12-02 07:53:22,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 07:53:22,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:53:22,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:53:22,667 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:53:22,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:53:22,667 INFO L82 PathProgramCache]: Analyzing trace with hash 764961535, now seen corresponding path program 1 times [2018-12-02 07:53:22,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 07:53:22,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 07:53:22,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:22,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:53:22,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:53:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:53:22,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:53:22,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:53:22,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:53:22,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:53:22,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:53:22,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:22,684 INFO L87 Difference]: Start difference. First operand 49160 states and 55814 transitions. Second operand 3 states. [2018-12-02 07:53:23,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:53:23,249 INFO L93 Difference]: Finished difference Result 109576 states and 122374 transitions. [2018-12-02 07:53:23,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:53:23,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-02 07:53:23,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:53:23,250 INFO L225 Difference]: With dead ends: 109576 [2018-12-02 07:53:23,250 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 07:53:23,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:53:23,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 07:53:23,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 07:53:23,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 07:53:23,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 07:53:23,301 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-12-02 07:53:23,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:53:23,301 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 07:53:23,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:53:23,301 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 07:53:23,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 07:53:23,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 07:53:23,324 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 07:53:23,324 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 07:53:23,324 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 07:53:23,324 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 07:53:23,325 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 07:53:23,325 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 07:53:23,325 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 177) no Hoare annotation was computed. [2018-12-02 07:53:23,325 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-12-02 07:53:23,325 INFO L448 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2018-12-02 07:53:23,325 INFO L448 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2018-12-02 07:53:23,325 INFO L448 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-12-02 07:53:23,325 INFO L444 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2018-12-02 07:53:23,325 INFO L448 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2018-12-02 07:53:23,325 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2018-12-02 07:53:23,325 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2018-12-02 07:53:23,325 INFO L448 ceAbstractionStarter]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2018-12-02 07:53:23,325 INFO L448 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2018-12-02 07:53:23,325 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2018-12-02 07:53:23,326 INFO L448 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-12-02 07:53:23,326 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2018-12-02 07:53:23,326 INFO L448 ceAbstractionStarter]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2018-12-02 07:53:23,326 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 177) no Hoare annotation was computed. [2018-12-02 07:53:23,326 INFO L448 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2018-12-02 07:53:23,326 INFO L448 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2018-12-02 07:53:23,326 INFO L448 ceAbstractionStarter]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2018-12-02 07:53:23,326 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2018-12-02 07:53:23,326 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 177) the Hoare annotation is: true [2018-12-02 07:53:23,326 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-12-02 07:53:23,326 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-12-02 07:53:23,326 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2018-12-02 07:53:23,326 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2018-12-02 07:53:23,327 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2018-12-02 07:53:23,327 INFO L448 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-12-02 07:53:23,327 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-12-02 07:53:23,327 INFO L451 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2018-12-02 07:53:23,327 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2018-12-02 07:53:23,327 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2018-12-02 07:53:23,327 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2018-12-02 07:53:23,327 INFO L448 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2018-12-02 07:53:23,327 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2018-12-02 07:53:23,327 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2018-12-02 07:53:23,327 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2018-12-02 07:53:23,327 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-12-02 07:53:23,327 INFO L448 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2018-12-02 07:53:23,327 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2018-12-02 07:53:23,328 INFO L448 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2018-12-02 07:53:23,328 INFO L451 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2018-12-02 07:53:23,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 07:53:23 BoogieIcfgContainer [2018-12-02 07:53:23,333 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 07:53:23,334 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 07:53:23,334 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 07:53:23,334 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 07:53:23,334 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:53:16" (3/4) ... [2018-12-02 07:53:23,338 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 07:53:23,343 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 07:53:23,343 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 07:53:23,347 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-02 07:53:23,347 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-02 07:53:23,347 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 07:53:23,382 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_951d1cf8-2c69-4b4a-8a08-9587382caed9/bin-2019/uautomizer/witness.graphml [2018-12-02 07:53:23,382 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 07:53:23,383 INFO L168 Benchmark]: Toolchain (without parser) took 7465.86 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 827.9 MB). Free memory was 962.4 MB in the beginning and 902.1 MB in the end (delta: 60.3 MB). Peak memory consumption was 888.2 MB. Max. memory is 11.5 GB. [2018-12-02 07:53:23,384 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:53:23,384 INFO L168 Benchmark]: CACSL2BoogieTranslator took 143.79 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 07:53:23,384 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.98 ms. Allocated memory is still 1.0 GB. Free memory was 951.7 MB in the beginning and 946.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 07:53:23,384 INFO L168 Benchmark]: Boogie Preprocessor took 45.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -189.4 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-02 07:53:23,385 INFO L168 Benchmark]: RCFGBuilder took 178.74 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: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2018-12-02 07:53:23,385 INFO L168 Benchmark]: TraceAbstraction took 7034.87 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 684.2 MB). Free memory was 1.1 GB in the beginning and 902.1 MB in the end (delta: 216.0 MB). Peak memory consumption was 900.2 MB. Max. memory is 11.5 GB. [2018-12-02 07:53:23,385 INFO L168 Benchmark]: Witness Printer took 48.43 ms. Allocated memory is still 1.9 GB. Free memory is still 902.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:53:23,386 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 143.79 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.98 ms. Allocated memory is still 1.0 GB. Free memory was 951.7 MB in the beginning and 946.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -189.4 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 178.74 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: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7034.87 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 684.2 MB). Free memory was 1.1 GB in the beginning and 902.1 MB in the end (delta: 216.0 MB). Peak memory consumption was 900.2 MB. Max. memory is 11.5 GB. * Witness Printer took 48.43 ms. Allocated memory is still 1.9 GB. Free memory is still 902.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 42]: 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, 47 locations, 1 error locations. SAFE Result, 6.9s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2877 SDtfs, 1405 SDslu, 1967 SDs, 0 SdLazy, 165 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49160occurred in iteration=30, 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: 3.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 8224 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 2058 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 777 ConstructedInterpolants, 0 QuantifiedInterpolants, 39912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...