./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_082f57aa-5eea-408f-8dc4-6947f16158c9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_082f57aa-5eea-408f-8dc4-6947f16158c9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_082f57aa-5eea-408f-8dc4-6947f16158c9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_082f57aa-5eea-408f-8dc4-6947f16158c9/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_082f57aa-5eea-408f-8dc4-6947f16158c9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_082f57aa-5eea-408f-8dc4-6947f16158c9/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 c5a3d22d49117f02662b197492bc1b16616a2878 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:19:57,302 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:19:57,303 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:19:57,311 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:19:57,311 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:19:57,311 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:19:57,312 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:19:57,313 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:19:57,314 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:19:57,315 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:19:57,315 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:19:57,315 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:19:57,316 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:19:57,317 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:19:57,317 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:19:57,318 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:19:57,318 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:19:57,320 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:19:57,321 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:19:57,322 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:19:57,323 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:19:57,323 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:19:57,325 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:19:57,325 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:19:57,325 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:19:57,326 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:19:57,327 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:19:57,327 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:19:57,328 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:19:57,329 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:19:57,329 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:19:57,329 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:19:57,329 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:19:57,330 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:19:57,330 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:19:57,331 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:19:57,331 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_082f57aa-5eea-408f-8dc4-6947f16158c9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 11:19:57,341 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:19:57,341 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:19:57,341 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:19:57,342 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:19:57,342 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:19:57,342 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:19:57,342 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:19:57,342 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:19:57,343 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:19:57,343 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:19:57,343 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:19:57,343 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:19:57,343 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 11:19:57,343 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:19:57,343 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 11:19:57,343 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:19:57,344 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:19:57,344 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:19:57,344 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 11:19:57,344 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:19:57,344 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:19:57,344 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:19:57,344 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:19:57,345 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:19:57,345 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:19:57,345 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:19:57,345 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 11:19:57,345 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:19:57,345 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:19:57,345 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 11:19:57,346 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_082f57aa-5eea-408f-8dc4-6947f16158c9/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 -> c5a3d22d49117f02662b197492bc1b16616a2878 [2018-11-28 11:19:57,369 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:19:57,377 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:19:57,380 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:19:57,381 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:19:57,381 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:19:57,382 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_082f57aa-5eea-408f-8dc4-6947f16158c9/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 11:19:57,422 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_082f57aa-5eea-408f-8dc4-6947f16158c9/bin-2019/uautomizer/data/f37b7b2e8/2eda8afb9e874f5ea1cd252802968305/FLAGb3f75c83c [2018-11-28 11:19:57,819 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:19:57,819 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_082f57aa-5eea-408f-8dc4-6947f16158c9/sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 11:19:57,825 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_082f57aa-5eea-408f-8dc4-6947f16158c9/bin-2019/uautomizer/data/f37b7b2e8/2eda8afb9e874f5ea1cd252802968305/FLAGb3f75c83c [2018-11-28 11:19:57,835 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_082f57aa-5eea-408f-8dc4-6947f16158c9/bin-2019/uautomizer/data/f37b7b2e8/2eda8afb9e874f5ea1cd252802968305 [2018-11-28 11:19:57,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:19:57,838 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:19:57,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:19:57,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:19:57,841 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:19:57,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:57" (1/1) ... [2018-11-28 11:19:57,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28035eee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:57, skipping insertion in model container [2018-11-28 11:19:57,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:57" (1/1) ... [2018-11-28 11:19:57,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:19:57,862 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:19:57,975 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:19:57,978 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:19:58,000 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:19:58,009 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:19:58,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:58 WrapperNode [2018-11-28 11:19:58,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:19:58,010 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:19:58,010 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:19:58,010 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:19:58,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:58" (1/1) ... [2018-11-28 11:19:58,018 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:58" (1/1) ... [2018-11-28 11:19:58,056 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:19:58,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:19:58,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:19:58,056 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:19:58,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:58" (1/1) ... [2018-11-28 11:19:58,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:58" (1/1) ... [2018-11-28 11:19:58,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:58" (1/1) ... [2018-11-28 11:19:58,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:58" (1/1) ... [2018-11-28 11:19:58,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:58" (1/1) ... [2018-11-28 11:19:58,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:58" (1/1) ... [2018-11-28 11:19:58,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:58" (1/1) ... [2018-11-28 11:19:58,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:19:58,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:19:58,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:19:58,077 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:19:58,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_082f57aa-5eea-408f-8dc4-6947f16158c9/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:19:58,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:19:58,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:19:58,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:19:58,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:19:58,112 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:19:58,112 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:19:58,303 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:19:58,304 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 11:19:58,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:58 BoogieIcfgContainer [2018-11-28 11:19:58,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:19:58,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:19:58,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:19:58,307 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:19:58,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:19:57" (1/3) ... [2018-11-28 11:19:58,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@818e62b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:19:58, skipping insertion in model container [2018-11-28 11:19:58,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:58" (2/3) ... [2018-11-28 11:19:58,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@818e62b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:19:58, skipping insertion in model container [2018-11-28 11:19:58,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:58" (3/3) ... [2018-11-28 11:19:58,310 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 11:19:58,318 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:19:58,324 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 11:19:58,337 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 11:19:58,358 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:19:58,358 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:19:58,359 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 11:19:58,359 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:19:58,359 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:19:58,359 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:19:58,359 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:19:58,359 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:19:58,359 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:19:58,371 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-11-28 11:19:58,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 11:19:58,375 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:58,375 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:58,377 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:58,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:58,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1694520263, now seen corresponding path program 1 times [2018-11-28 11:19:58,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:58,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:58,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:58,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:58,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:58,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:58,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:58,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:19:58,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:19:58,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:19:58,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:58,533 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2018-11-28 11:19:58,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:58,566 INFO L93 Difference]: Finished difference Result 111 states and 198 transitions. [2018-11-28 11:19:58,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:19:58,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 11:19:58,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:58,576 INFO L225 Difference]: With dead ends: 111 [2018-11-28 11:19:58,576 INFO L226 Difference]: Without dead ends: 96 [2018-11-28 11:19:58,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:58,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-28 11:19:58,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2018-11-28 11:19:58,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-28 11:19:58,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 121 transitions. [2018-11-28 11:19:58,607 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 121 transitions. Word has length 24 [2018-11-28 11:19:58,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:58,607 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 121 transitions. [2018-11-28 11:19:58,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:19:58,607 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 121 transitions. [2018-11-28 11:19:58,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 11:19:58,608 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:58,608 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:58,608 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:58,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:58,608 INFO L82 PathProgramCache]: Analyzing trace with hash 106172361, now seen corresponding path program 1 times [2018-11-28 11:19:58,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:58,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:58,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:58,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:58,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:58,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:58,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:58,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:19:58,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:19:58,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:19:58,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:58,652 INFO L87 Difference]: Start difference. First operand 66 states and 121 transitions. Second operand 3 states. [2018-11-28 11:19:58,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:58,687 INFO L93 Difference]: Finished difference Result 157 states and 292 transitions. [2018-11-28 11:19:58,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:19:58,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 11:19:58,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:58,688 INFO L225 Difference]: With dead ends: 157 [2018-11-28 11:19:58,688 INFO L226 Difference]: Without dead ends: 96 [2018-11-28 11:19:58,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:58,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-28 11:19:58,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-11-28 11:19:58,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-28 11:19:58,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 173 transitions. [2018-11-28 11:19:58,695 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 173 transitions. Word has length 24 [2018-11-28 11:19:58,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:58,696 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 173 transitions. [2018-11-28 11:19:58,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:19:58,696 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 173 transitions. [2018-11-28 11:19:58,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 11:19:58,696 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:58,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:58,697 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:58,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:58,697 INFO L82 PathProgramCache]: Analyzing trace with hash 990732685, now seen corresponding path program 1 times [2018-11-28 11:19:58,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:58,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:58,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:58,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:58,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:58,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:58,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:19:58,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:19:58,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:19:58,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:58,740 INFO L87 Difference]: Start difference. First operand 94 states and 173 transitions. Second operand 3 states. [2018-11-28 11:19:58,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:58,755 INFO L93 Difference]: Finished difference Result 144 states and 261 transitions. [2018-11-28 11:19:58,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:19:58,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 11:19:58,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:58,758 INFO L225 Difference]: With dead ends: 144 [2018-11-28 11:19:58,758 INFO L226 Difference]: Without dead ends: 99 [2018-11-28 11:19:58,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:58,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-28 11:19:58,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-11-28 11:19:58,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-28 11:19:58,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 175 transitions. [2018-11-28 11:19:58,769 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 175 transitions. Word has length 25 [2018-11-28 11:19:58,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:58,770 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 175 transitions. [2018-11-28 11:19:58,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:19:58,770 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2018-11-28 11:19:58,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 11:19:58,771 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:58,771 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:58,771 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:58,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:58,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1003412021, now seen corresponding path program 1 times [2018-11-28 11:19:58,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:58,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:58,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:58,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:58,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:58,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:58,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:58,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:19:58,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:19:58,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:19:58,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:58,805 INFO L87 Difference]: Start difference. First operand 97 states and 175 transitions. Second operand 3 states. [2018-11-28 11:19:58,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:58,817 INFO L93 Difference]: Finished difference Result 184 states and 336 transitions. [2018-11-28 11:19:58,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:19:58,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 11:19:58,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:58,818 INFO L225 Difference]: With dead ends: 184 [2018-11-28 11:19:58,818 INFO L226 Difference]: Without dead ends: 182 [2018-11-28 11:19:58,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:58,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-28 11:19:58,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 128. [2018-11-28 11:19:58,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-28 11:19:58,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 232 transitions. [2018-11-28 11:19:58,828 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 232 transitions. Word has length 25 [2018-11-28 11:19:58,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:58,829 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 232 transitions. [2018-11-28 11:19:58,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:19:58,829 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 232 transitions. [2018-11-28 11:19:58,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 11:19:58,830 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:58,831 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:58,831 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:58,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:58,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1703207373, now seen corresponding path program 1 times [2018-11-28 11:19:58,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:58,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:58,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:58,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:58,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:58,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:58,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:19:58,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:19:58,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:19:58,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:58,863 INFO L87 Difference]: Start difference. First operand 128 states and 232 transitions. Second operand 3 states. [2018-11-28 11:19:58,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:58,881 INFO L93 Difference]: Finished difference Result 304 states and 558 transitions. [2018-11-28 11:19:58,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:19:58,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 11:19:58,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:58,883 INFO L225 Difference]: With dead ends: 304 [2018-11-28 11:19:58,883 INFO L226 Difference]: Without dead ends: 184 [2018-11-28 11:19:58,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:58,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-28 11:19:58,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2018-11-28 11:19:58,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-28 11:19:58,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 330 transitions. [2018-11-28 11:19:58,892 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 330 transitions. Word has length 25 [2018-11-28 11:19:58,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:58,893 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 330 transitions. [2018-11-28 11:19:58,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:19:58,893 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 330 transitions. [2018-11-28 11:19:58,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 11:19:58,895 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:58,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:58,895 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:58,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:58,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1040789154, now seen corresponding path program 1 times [2018-11-28 11:19:58,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:58,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:58,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:58,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:58,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:58,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-11-28 11:19:58,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:58,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:19:58,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:19:58,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:19:58,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:58,936 INFO L87 Difference]: Start difference. First operand 182 states and 330 transitions. Second operand 3 states. [2018-11-28 11:19:58,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:58,955 INFO L93 Difference]: Finished difference Result 273 states and 493 transitions. [2018-11-28 11:19:58,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:19:58,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 11:19:58,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:58,957 INFO L225 Difference]: With dead ends: 273 [2018-11-28 11:19:58,957 INFO L226 Difference]: Without dead ends: 186 [2018-11-28 11:19:58,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:58,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-28 11:19:58,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2018-11-28 11:19:58,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-28 11:19:58,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 330 transitions. [2018-11-28 11:19:58,966 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 330 transitions. Word has length 26 [2018-11-28 11:19:58,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:58,966 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 330 transitions. [2018-11-28 11:19:58,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:19:58,967 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 330 transitions. [2018-11-28 11:19:58,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 11:19:58,967 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:58,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:58,968 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:58,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:58,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1260033436, now seen corresponding path program 1 times [2018-11-28 11:19:58,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:58,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:58,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:58,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:58,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:58,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:59,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:59,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:19:59,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:19:59,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:19:59,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:59,000 INFO L87 Difference]: Start difference. First operand 184 states and 330 transitions. Second operand 3 states. [2018-11-28 11:19:59,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:59,015 INFO L93 Difference]: Finished difference Result 348 states and 632 transitions. [2018-11-28 11:19:59,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:19:59,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 11:19:59,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:59,017 INFO L225 Difference]: With dead ends: 348 [2018-11-28 11:19:59,017 INFO L226 Difference]: Without dead ends: 346 [2018-11-28 11:19:59,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:59,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-11-28 11:19:59,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 248. [2018-11-28 11:19:59,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-11-28 11:19:59,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 442 transitions. [2018-11-28 11:19:59,026 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 442 transitions. Word has length 26 [2018-11-28 11:19:59,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:59,026 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 442 transitions. [2018-11-28 11:19:59,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:19:59,027 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 442 transitions. [2018-11-28 11:19:59,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 11:19:59,028 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:59,028 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:59,028 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:59,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:59,028 INFO L82 PathProgramCache]: Analyzing trace with hash -328314466, now seen corresponding path program 1 times [2018-11-28 11:19:59,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:59,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:59,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:59,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:59,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:59,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-11-28 11:19:59,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:59,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:19:59,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:19:59,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:19:59,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:59,053 INFO L87 Difference]: Start difference. First operand 248 states and 442 transitions. Second operand 3 states. [2018-11-28 11:19:59,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:59,079 INFO L93 Difference]: Finished difference Result 592 states and 1064 transitions. [2018-11-28 11:19:59,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:19:59,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 11:19:59,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:59,081 INFO L225 Difference]: With dead ends: 592 [2018-11-28 11:19:59,081 INFO L226 Difference]: Without dead ends: 354 [2018-11-28 11:19:59,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:59,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-11-28 11:19:59,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2018-11-28 11:19:59,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-11-28 11:19:59,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 626 transitions. [2018-11-28 11:19:59,091 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 626 transitions. Word has length 26 [2018-11-28 11:19:59,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:59,092 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 626 transitions. [2018-11-28 11:19:59,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:19:59,092 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 626 transitions. [2018-11-28 11:19:59,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 11:19:59,093 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:59,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:59,093 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:59,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:59,093 INFO L82 PathProgramCache]: Analyzing trace with hash 406543618, now seen corresponding path program 1 times [2018-11-28 11:19:59,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:59,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:59,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:59,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:59,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:59,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:59,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:59,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:19:59,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:19:59,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:19:59,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:59,125 INFO L87 Difference]: Start difference. First operand 352 states and 626 transitions. Second operand 3 states. [2018-11-28 11:19:59,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:59,141 INFO L93 Difference]: Finished difference Result 528 states and 936 transitions. [2018-11-28 11:19:59,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:19:59,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 11:19:59,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:59,142 INFO L225 Difference]: With dead ends: 528 [2018-11-28 11:19:59,143 INFO L226 Difference]: Without dead ends: 358 [2018-11-28 11:19:59,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:59,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-11-28 11:19:59,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-11-28 11:19:59,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-28 11:19:59,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 626 transitions. [2018-11-28 11:19:59,151 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 626 transitions. Word has length 27 [2018-11-28 11:19:59,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:59,151 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 626 transitions. [2018-11-28 11:19:59,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:19:59,151 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 626 transitions. [2018-11-28 11:19:59,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 11:19:59,152 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:59,152 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:59,152 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:59,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:59,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1587601088, now seen corresponding path program 1 times [2018-11-28 11:19:59,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:59,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:59,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:59,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:59,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:59,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:59,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:59,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:19:59,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:19:59,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:19:59,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:59,175 INFO L87 Difference]: Start difference. First operand 356 states and 626 transitions. Second operand 3 states. [2018-11-28 11:19:59,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:59,207 INFO L93 Difference]: Finished difference Result 668 states and 1192 transitions. [2018-11-28 11:19:59,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:19:59,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 11:19:59,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:59,210 INFO L225 Difference]: With dead ends: 668 [2018-11-28 11:19:59,210 INFO L226 Difference]: Without dead ends: 666 [2018-11-28 11:19:59,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:59,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-11-28 11:19:59,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 488. [2018-11-28 11:19:59,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-11-28 11:19:59,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 846 transitions. [2018-11-28 11:19:59,221 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 846 transitions. Word has length 27 [2018-11-28 11:19:59,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:59,222 INFO L480 AbstractCegarLoop]: Abstraction has 488 states and 846 transitions. [2018-11-28 11:19:59,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:19:59,222 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 846 transitions. [2018-11-28 11:19:59,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 11:19:59,223 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:59,223 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:59,223 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:59,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:59,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1119018306, now seen corresponding path program 1 times [2018-11-28 11:19:59,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:59,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:59,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:59,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:59,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:59,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:59,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:59,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:19:59,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:19:59,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:19:59,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:59,243 INFO L87 Difference]: Start difference. First operand 488 states and 846 transitions. Second operand 3 states. [2018-11-28 11:19:59,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:59,266 INFO L93 Difference]: Finished difference Result 1164 states and 2032 transitions. [2018-11-28 11:19:59,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:19:59,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 11:19:59,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:59,268 INFO L225 Difference]: With dead ends: 1164 [2018-11-28 11:19:59,268 INFO L226 Difference]: Without dead ends: 690 [2018-11-28 11:19:59,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:59,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-11-28 11:19:59,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2018-11-28 11:19:59,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2018-11-28 11:19:59,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1190 transitions. [2018-11-28 11:19:59,283 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1190 transitions. Word has length 27 [2018-11-28 11:19:59,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:59,283 INFO L480 AbstractCegarLoop]: Abstraction has 688 states and 1190 transitions. [2018-11-28 11:19:59,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:19:59,283 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1190 transitions. [2018-11-28 11:19:59,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 11:19:59,284 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:59,285 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:59,285 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:59,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:59,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1970780365, now seen corresponding path program 1 times [2018-11-28 11:19:59,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:59,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:59,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:59,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:59,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:59,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:59,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:59,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:19:59,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:19:59,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:19:59,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:59,304 INFO L87 Difference]: Start difference. First operand 688 states and 1190 transitions. Second operand 3 states. [2018-11-28 11:19:59,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:59,327 INFO L93 Difference]: Finished difference Result 1032 states and 1780 transitions. [2018-11-28 11:19:59,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:19:59,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 11:19:59,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:59,329 INFO L225 Difference]: With dead ends: 1032 [2018-11-28 11:19:59,329 INFO L226 Difference]: Without dead ends: 698 [2018-11-28 11:19:59,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:59,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-11-28 11:19:59,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2018-11-28 11:19:59,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2018-11-28 11:19:59,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1190 transitions. [2018-11-28 11:19:59,342 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1190 transitions. Word has length 28 [2018-11-28 11:19:59,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:59,343 INFO L480 AbstractCegarLoop]: Abstraction has 696 states and 1190 transitions. [2018-11-28 11:19:59,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:19:59,343 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1190 transitions. [2018-11-28 11:19:59,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 11:19:59,344 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:59,344 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:59,344 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:59,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:59,344 INFO L82 PathProgramCache]: Analyzing trace with hash 330042225, now seen corresponding path program 1 times [2018-11-28 11:19:59,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:59,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:59,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:59,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:59,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:59,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:59,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:59,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:19:59,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:19:59,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:19:59,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:59,368 INFO L87 Difference]: Start difference. First operand 696 states and 1190 transitions. Second operand 3 states. [2018-11-28 11:19:59,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:59,388 INFO L93 Difference]: Finished difference Result 1292 states and 2248 transitions. [2018-11-28 11:19:59,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:19:59,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 11:19:59,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:59,391 INFO L225 Difference]: With dead ends: 1292 [2018-11-28 11:19:59,391 INFO L226 Difference]: Without dead ends: 1290 [2018-11-28 11:19:59,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:59,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-11-28 11:19:59,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 968. [2018-11-28 11:19:59,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2018-11-28 11:19:59,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1622 transitions. [2018-11-28 11:19:59,410 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1622 transitions. Word has length 28 [2018-11-28 11:19:59,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:59,410 INFO L480 AbstractCegarLoop]: Abstraction has 968 states and 1622 transitions. [2018-11-28 11:19:59,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:19:59,410 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1622 transitions. [2018-11-28 11:19:59,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 11:19:59,411 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:59,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:59,412 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:59,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:59,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1258305677, now seen corresponding path program 1 times [2018-11-28 11:19:59,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:59,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:59,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:59,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:59,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:59,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:59,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:59,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:19:59,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:19:59,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:19:59,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:59,436 INFO L87 Difference]: Start difference. First operand 968 states and 1622 transitions. Second operand 3 states. [2018-11-28 11:19:59,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:59,460 INFO L93 Difference]: Finished difference Result 2300 states and 3880 transitions. [2018-11-28 11:19:59,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:19:59,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 11:19:59,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:59,463 INFO L225 Difference]: With dead ends: 2300 [2018-11-28 11:19:59,463 INFO L226 Difference]: Without dead ends: 1354 [2018-11-28 11:19:59,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:59,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-11-28 11:19:59,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2018-11-28 11:19:59,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-11-28 11:19:59,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2262 transitions. [2018-11-28 11:19:59,490 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2262 transitions. Word has length 28 [2018-11-28 11:19:59,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:59,490 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 2262 transitions. [2018-11-28 11:19:59,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:19:59,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2262 transitions. [2018-11-28 11:19:59,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 11:19:59,491 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:59,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:59,492 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:59,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:59,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1641587831, now seen corresponding path program 1 times [2018-11-28 11:19:59,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:59,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:59,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:59,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:59,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:59,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:59,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:59,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:19:59,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:19:59,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:19:59,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:59,520 INFO L87 Difference]: Start difference. First operand 1352 states and 2262 transitions. Second operand 3 states. [2018-11-28 11:19:59,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:59,539 INFO L93 Difference]: Finished difference Result 2028 states and 3384 transitions. [2018-11-28 11:19:59,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:19:59,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 11:19:59,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:59,542 INFO L225 Difference]: With dead ends: 2028 [2018-11-28 11:19:59,542 INFO L226 Difference]: Without dead ends: 1370 [2018-11-28 11:19:59,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:59,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2018-11-28 11:19:59,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1368. [2018-11-28 11:19:59,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2018-11-28 11:19:59,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2262 transitions. [2018-11-28 11:19:59,569 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2262 transitions. Word has length 29 [2018-11-28 11:19:59,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:59,569 INFO L480 AbstractCegarLoop]: Abstraction has 1368 states and 2262 transitions. [2018-11-28 11:19:59,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:19:59,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2262 transitions. [2018-11-28 11:19:59,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 11:19:59,571 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:59,571 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:59,571 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:59,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:59,571 INFO L82 PathProgramCache]: Analyzing trace with hash -352556875, now seen corresponding path program 1 times [2018-11-28 11:19:59,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:59,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:59,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:59,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:59,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:59,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:59,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:59,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:19:59,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:19:59,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:19:59,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:59,592 INFO L87 Difference]: Start difference. First operand 1368 states and 2262 transitions. Second operand 3 states. [2018-11-28 11:19:59,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:59,621 INFO L93 Difference]: Finished difference Result 2508 states and 4232 transitions. [2018-11-28 11:19:59,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:19:59,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 11:19:59,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:59,626 INFO L225 Difference]: With dead ends: 2508 [2018-11-28 11:19:59,626 INFO L226 Difference]: Without dead ends: 2506 [2018-11-28 11:19:59,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:59,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2018-11-28 11:19:59,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1928. [2018-11-28 11:19:59,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-11-28 11:19:59,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 3110 transitions. [2018-11-28 11:19:59,662 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 3110 transitions. Word has length 29 [2018-11-28 11:19:59,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:59,662 INFO L480 AbstractCegarLoop]: Abstraction has 1928 states and 3110 transitions. [2018-11-28 11:19:59,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:19:59,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 3110 transitions. [2018-11-28 11:19:59,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 11:19:59,665 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:59,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:59,665 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:59,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:59,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1940904777, now seen corresponding path program 1 times [2018-11-28 11:19:59,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:59,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:59,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:59,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:59,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:59,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:59,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:59,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:19:59,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:19:59,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:19:59,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:59,688 INFO L87 Difference]: Start difference. First operand 1928 states and 3110 transitions. Second operand 3 states. [2018-11-28 11:19:59,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:59,730 INFO L93 Difference]: Finished difference Result 4556 states and 7400 transitions. [2018-11-28 11:19:59,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:19:59,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 11:19:59,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:59,735 INFO L225 Difference]: With dead ends: 4556 [2018-11-28 11:19:59,735 INFO L226 Difference]: Without dead ends: 2666 [2018-11-28 11:19:59,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:59,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2018-11-28 11:19:59,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2664. [2018-11-28 11:19:59,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2664 states. [2018-11-28 11:19:59,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 4294 transitions. [2018-11-28 11:19:59,808 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 4294 transitions. Word has length 29 [2018-11-28 11:19:59,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:59,808 INFO L480 AbstractCegarLoop]: Abstraction has 2664 states and 4294 transitions. [2018-11-28 11:19:59,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:19:59,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 4294 transitions. [2018-11-28 11:19:59,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 11:19:59,811 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:59,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:59,811 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:59,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:59,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1955852552, now seen corresponding path program 1 times [2018-11-28 11:19:59,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:59,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:59,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:59,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:59,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:59,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:59,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:59,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:19:59,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:19:59,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:19:59,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:59,827 INFO L87 Difference]: Start difference. First operand 2664 states and 4294 transitions. Second operand 3 states. [2018-11-28 11:19:59,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:19:59,871 INFO L93 Difference]: Finished difference Result 3996 states and 6424 transitions. [2018-11-28 11:19:59,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:19:59,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 11:19:59,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:19:59,877 INFO L225 Difference]: With dead ends: 3996 [2018-11-28 11:19:59,877 INFO L226 Difference]: Without dead ends: 2698 [2018-11-28 11:19:59,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:59,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2018-11-28 11:19:59,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2696. [2018-11-28 11:19:59,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2018-11-28 11:19:59,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 4294 transitions. [2018-11-28 11:19:59,924 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 4294 transitions. Word has length 30 [2018-11-28 11:19:59,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:19:59,924 INFO L480 AbstractCegarLoop]: Abstraction has 2696 states and 4294 transitions. [2018-11-28 11:19:59,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:19:59,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 4294 transitions. [2018-11-28 11:19:59,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 11:19:59,926 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:19:59,926 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:19:59,926 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:19:59,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:19:59,927 INFO L82 PathProgramCache]: Analyzing trace with hash -38292154, now seen corresponding path program 1 times [2018-11-28 11:19:59,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:19:59,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:19:59,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:59,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:19:59,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:19:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:19:59,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:19:59,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:19:59,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:19:59,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:19:59,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:19:59,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:19:59,947 INFO L87 Difference]: Start difference. First operand 2696 states and 4294 transitions. Second operand 3 states. [2018-11-28 11:20:00,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:00,003 INFO L93 Difference]: Finished difference Result 4876 states and 7944 transitions. [2018-11-28 11:20:00,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:20:00,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 11:20:00,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:00,013 INFO L225 Difference]: With dead ends: 4876 [2018-11-28 11:20:00,013 INFO L226 Difference]: Without dead ends: 4874 [2018-11-28 11:20:00,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:00,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2018-11-28 11:20:00,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 3848. [2018-11-28 11:20:00,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3848 states. [2018-11-28 11:20:00,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 5958 transitions. [2018-11-28 11:20:00,078 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 5958 transitions. Word has length 30 [2018-11-28 11:20:00,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:00,078 INFO L480 AbstractCegarLoop]: Abstraction has 3848 states and 5958 transitions. [2018-11-28 11:20:00,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:20:00,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 5958 transitions. [2018-11-28 11:20:00,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 11:20:00,081 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:00,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:00,082 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:00,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:00,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1626640056, now seen corresponding path program 1 times [2018-11-28 11:20:00,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:00,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:00,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:00,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:00,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:00,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:20:00,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:00,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:20:00,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:20:00,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:20:00,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:00,107 INFO L87 Difference]: Start difference. First operand 3848 states and 5958 transitions. Second operand 3 states. [2018-11-28 11:20:00,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:00,171 INFO L93 Difference]: Finished difference Result 9036 states and 14088 transitions. [2018-11-28 11:20:00,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:20:00,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 11:20:00,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:00,184 INFO L225 Difference]: With dead ends: 9036 [2018-11-28 11:20:00,184 INFO L226 Difference]: Without dead ends: 5258 [2018-11-28 11:20:00,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:00,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2018-11-28 11:20:00,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5256. [2018-11-28 11:20:00,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5256 states. [2018-11-28 11:20:00,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5256 states to 5256 states and 8134 transitions. [2018-11-28 11:20:00,277 INFO L78 Accepts]: Start accepts. Automaton has 5256 states and 8134 transitions. Word has length 30 [2018-11-28 11:20:00,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:00,277 INFO L480 AbstractCegarLoop]: Abstraction has 5256 states and 8134 transitions. [2018-11-28 11:20:00,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:20:00,277 INFO L276 IsEmpty]: Start isEmpty. Operand 5256 states and 8134 transitions. [2018-11-28 11:20:00,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 11:20:00,280 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:00,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:00,280 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:00,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:00,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1186842644, now seen corresponding path program 1 times [2018-11-28 11:20:00,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:00,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:00,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:00,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:00,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:00,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:20:00,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:00,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:20:00,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:20:00,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:20:00,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:00,303 INFO L87 Difference]: Start difference. First operand 5256 states and 8134 transitions. Second operand 3 states. [2018-11-28 11:20:00,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:00,360 INFO L93 Difference]: Finished difference Result 7884 states and 12168 transitions. [2018-11-28 11:20:00,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:20:00,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 11:20:00,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:00,371 INFO L225 Difference]: With dead ends: 7884 [2018-11-28 11:20:00,371 INFO L226 Difference]: Without dead ends: 5322 [2018-11-28 11:20:00,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:00,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2018-11-28 11:20:00,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 5320. [2018-11-28 11:20:00,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5320 states. [2018-11-28 11:20:00,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5320 states to 5320 states and 8134 transitions. [2018-11-28 11:20:00,452 INFO L78 Accepts]: Start accepts. Automaton has 5320 states and 8134 transitions. Word has length 31 [2018-11-28 11:20:00,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:00,452 INFO L480 AbstractCegarLoop]: Abstraction has 5320 states and 8134 transitions. [2018-11-28 11:20:00,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:20:00,452 INFO L276 IsEmpty]: Start isEmpty. Operand 5320 states and 8134 transitions. [2018-11-28 11:20:00,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 11:20:00,455 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:00,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, 1, 1] [2018-11-28 11:20:00,455 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:00,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:00,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1113979946, now seen corresponding path program 1 times [2018-11-28 11:20:00,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:00,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:00,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:00,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:00,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:20:00,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:00,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:20:00,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:20:00,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:20:00,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:00,475 INFO L87 Difference]: Start difference. First operand 5320 states and 8134 transitions. Second operand 3 states. [2018-11-28 11:20:00,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:00,581 INFO L93 Difference]: Finished difference Result 15564 states and 23624 transitions. [2018-11-28 11:20:00,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:20:00,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 11:20:00,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:00,594 INFO L225 Difference]: With dead ends: 15564 [2018-11-28 11:20:00,595 INFO L226 Difference]: Without dead ends: 10378 [2018-11-28 11:20:00,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:00,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2018-11-28 11:20:00,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 10376. [2018-11-28 11:20:00,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2018-11-28 11:20:00,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15494 transitions. [2018-11-28 11:20:00,843 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15494 transitions. Word has length 31 [2018-11-28 11:20:00,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:00,843 INFO L480 AbstractCegarLoop]: Abstraction has 10376 states and 15494 transitions. [2018-11-28 11:20:00,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:20:00,843 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15494 transitions. [2018-11-28 11:20:00,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 11:20:00,851 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:00,851 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:00,851 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:00,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:00,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1592639448, now seen corresponding path program 1 times [2018-11-28 11:20:00,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:00,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:00,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:00,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:00,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:00,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:20:00,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:00,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:20:00,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:20:00,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:20:00,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:00,876 INFO L87 Difference]: Start difference. First operand 10376 states and 15494 transitions. Second operand 3 states. [2018-11-28 11:20:01,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:01,056 INFO L93 Difference]: Finished difference Result 12172 states and 18824 transitions. [2018-11-28 11:20:01,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:20:01,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 11:20:01,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:01,077 INFO L225 Difference]: With dead ends: 12172 [2018-11-28 11:20:01,077 INFO L226 Difference]: Without dead ends: 12170 [2018-11-28 11:20:01,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:01,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2018-11-28 11:20:01,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 10376. [2018-11-28 11:20:01,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2018-11-28 11:20:01,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15366 transitions. [2018-11-28 11:20:01,315 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15366 transitions. Word has length 31 [2018-11-28 11:20:01,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:01,315 INFO L480 AbstractCegarLoop]: Abstraction has 10376 states and 15366 transitions. [2018-11-28 11:20:01,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:20:01,315 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15366 transitions. [2018-11-28 11:20:01,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 11:20:01,323 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:01,323 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:01,323 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:01,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:01,323 INFO L82 PathProgramCache]: Analyzing trace with hash 173854429, now seen corresponding path program 1 times [2018-11-28 11:20:01,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:01,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:01,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:01,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:01,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:01,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:20:01,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:01,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:20:01,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:20:01,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:20:01,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:01,340 INFO L87 Difference]: Start difference. First operand 10376 states and 15366 transitions. Second operand 3 states. [2018-11-28 11:20:01,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:01,534 INFO L93 Difference]: Finished difference Result 18316 states and 27784 transitions. [2018-11-28 11:20:01,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:20:01,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-28 11:20:01,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:01,562 INFO L225 Difference]: With dead ends: 18316 [2018-11-28 11:20:01,562 INFO L226 Difference]: Without dead ends: 18314 [2018-11-28 11:20:01,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:01,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18314 states. [2018-11-28 11:20:01,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18314 to 15240. [2018-11-28 11:20:01,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15240 states. [2018-11-28 11:20:01,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15240 states to 15240 states and 21894 transitions. [2018-11-28 11:20:01,763 INFO L78 Accepts]: Start accepts. Automaton has 15240 states and 21894 transitions. Word has length 32 [2018-11-28 11:20:01,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:01,763 INFO L480 AbstractCegarLoop]: Abstraction has 15240 states and 21894 transitions. [2018-11-28 11:20:01,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:20:01,764 INFO L276 IsEmpty]: Start isEmpty. Operand 15240 states and 21894 transitions. [2018-11-28 11:20:01,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 11:20:01,774 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:01,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:01,775 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:01,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:01,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1414493473, now seen corresponding path program 1 times [2018-11-28 11:20:01,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:01,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:01,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:01,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:01,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:01,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:20:01,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:01,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:20:01,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:20:01,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:20:01,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:01,800 INFO L87 Difference]: Start difference. First operand 15240 states and 21894 transitions. Second operand 3 states. [2018-11-28 11:20:01,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:01,983 INFO L93 Difference]: Finished difference Result 35468 states and 51336 transitions. [2018-11-28 11:20:01,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:20:01,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-28 11:20:01,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:02,002 INFO L225 Difference]: With dead ends: 35468 [2018-11-28 11:20:02,002 INFO L226 Difference]: Without dead ends: 20362 [2018-11-28 11:20:02,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:02,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20362 states. [2018-11-28 11:20:02,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20362 to 20360. [2018-11-28 11:20:02,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2018-11-28 11:20:02,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 29190 transitions. [2018-11-28 11:20:02,246 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 29190 transitions. Word has length 32 [2018-11-28 11:20:02,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:02,246 INFO L480 AbstractCegarLoop]: Abstraction has 20360 states and 29190 transitions. [2018-11-28 11:20:02,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:20:02,247 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 29190 transitions. [2018-11-28 11:20:02,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 11:20:02,256 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:02,256 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:02,256 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:02,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:02,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1094734815, now seen corresponding path program 1 times [2018-11-28 11:20:02,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:02,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:02,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:02,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:02,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:20:02,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:02,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:20:02,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:20:02,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:20:02,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:02,279 INFO L87 Difference]: Start difference. First operand 20360 states and 29190 transitions. Second operand 3 states. [2018-11-28 11:20:02,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:02,426 INFO L93 Difference]: Finished difference Result 30732 states and 44040 transitions. [2018-11-28 11:20:02,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:20:02,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-28 11:20:02,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:02,445 INFO L225 Difference]: With dead ends: 30732 [2018-11-28 11:20:02,445 INFO L226 Difference]: Without dead ends: 20746 [2018-11-28 11:20:02,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:02,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20746 states. [2018-11-28 11:20:02,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20746 to 20744. [2018-11-28 11:20:02,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20744 states. [2018-11-28 11:20:02,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20744 states to 20744 states and 29446 transitions. [2018-11-28 11:20:02,848 INFO L78 Accepts]: Start accepts. Automaton has 20744 states and 29446 transitions. Word has length 33 [2018-11-28 11:20:02,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:02,848 INFO L480 AbstractCegarLoop]: Abstraction has 20744 states and 29446 transitions. [2018-11-28 11:20:02,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:20:02,849 INFO L276 IsEmpty]: Start isEmpty. Operand 20744 states and 29446 transitions. [2018-11-28 11:20:02,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 11:20:02,862 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:02,862 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:02,862 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:02,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:02,863 INFO L82 PathProgramCache]: Analyzing trace with hash -899409891, now seen corresponding path program 1 times [2018-11-28 11:20:02,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:02,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:02,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:02,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:02,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:02,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:20:02,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:02,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:20:02,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:20:02,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:20:02,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:02,906 INFO L87 Difference]: Start difference. First operand 20744 states and 29446 transitions. Second operand 3 states. [2018-11-28 11:20:03,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:03,301 INFO L93 Difference]: Finished difference Result 35852 states and 51976 transitions. [2018-11-28 11:20:03,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:20:03,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-28 11:20:03,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:03,335 INFO L225 Difference]: With dead ends: 35852 [2018-11-28 11:20:03,335 INFO L226 Difference]: Without dead ends: 35850 [2018-11-28 11:20:03,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:03,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35850 states. [2018-11-28 11:20:03,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35850 to 30728. [2018-11-28 11:20:03,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30728 states. [2018-11-28 11:20:03,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30728 states to 30728 states and 42246 transitions. [2018-11-28 11:20:03,829 INFO L78 Accepts]: Start accepts. Automaton has 30728 states and 42246 transitions. Word has length 33 [2018-11-28 11:20:03,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:03,829 INFO L480 AbstractCegarLoop]: Abstraction has 30728 states and 42246 transitions. [2018-11-28 11:20:03,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:20:03,829 INFO L276 IsEmpty]: Start isEmpty. Operand 30728 states and 42246 transitions. [2018-11-28 11:20:03,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 11:20:03,841 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:03,842 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:03,842 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:03,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:03,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1807209503, now seen corresponding path program 1 times [2018-11-28 11:20:03,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:03,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:03,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:03,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:03,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:03,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:20:03,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:03,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:20:03,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:20:03,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:20:03,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:03,871 INFO L87 Difference]: Start difference. First operand 30728 states and 42246 transitions. Second operand 3 states. [2018-11-28 11:20:04,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:04,169 INFO L93 Difference]: Finished difference Result 70668 states and 97544 transitions. [2018-11-28 11:20:04,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:20:04,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-28 11:20:04,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:04,200 INFO L225 Difference]: With dead ends: 70668 [2018-11-28 11:20:04,200 INFO L226 Difference]: Without dead ends: 40458 [2018-11-28 11:20:04,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:04,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40458 states. [2018-11-28 11:20:04,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40458 to 40456. [2018-11-28 11:20:04,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40456 states. [2018-11-28 11:20:04,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40456 states to 40456 states and 55302 transitions. [2018-11-28 11:20:04,785 INFO L78 Accepts]: Start accepts. Automaton has 40456 states and 55302 transitions. Word has length 33 [2018-11-28 11:20:04,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:04,785 INFO L480 AbstractCegarLoop]: Abstraction has 40456 states and 55302 transitions. [2018-11-28 11:20:04,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:20:04,785 INFO L276 IsEmpty]: Start isEmpty. Operand 40456 states and 55302 transitions. [2018-11-28 11:20:04,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 11:20:04,796 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:04,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:04,796 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:04,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:04,796 INFO L82 PathProgramCache]: Analyzing trace with hash -2111687692, now seen corresponding path program 1 times [2018-11-28 11:20:04,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:04,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:04,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:04,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:04,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:04,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:20:04,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:04,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:20:04,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:20:04,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:20:04,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:04,832 INFO L87 Difference]: Start difference. First operand 40456 states and 55302 transitions. Second operand 3 states. [2018-11-28 11:20:05,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:05,128 INFO L93 Difference]: Finished difference Result 60684 states and 82696 transitions. [2018-11-28 11:20:05,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:20:05,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-28 11:20:05,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:05,159 INFO L225 Difference]: With dead ends: 60684 [2018-11-28 11:20:05,159 INFO L226 Difference]: Without dead ends: 40970 [2018-11-28 11:20:05,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:05,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40970 states. [2018-11-28 11:20:05,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40970 to 40968. [2018-11-28 11:20:05,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40968 states. [2018-11-28 11:20:05,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40968 states to 40968 states and 55302 transitions. [2018-11-28 11:20:05,631 INFO L78 Accepts]: Start accepts. Automaton has 40968 states and 55302 transitions. Word has length 34 [2018-11-28 11:20:05,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:05,631 INFO L480 AbstractCegarLoop]: Abstraction has 40968 states and 55302 transitions. [2018-11-28 11:20:05,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:20:05,632 INFO L276 IsEmpty]: Start isEmpty. Operand 40968 states and 55302 transitions. [2018-11-28 11:20:05,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 11:20:05,646 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:05,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:05,647 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:05,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:05,647 INFO L82 PathProgramCache]: Analyzing trace with hash 189134898, now seen corresponding path program 1 times [2018-11-28 11:20:05,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:05,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:05,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:05,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:05,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:05,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:05,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:20:05,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:05,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:20:05,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:20:05,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:20:05,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:05,676 INFO L87 Difference]: Start difference. First operand 40968 states and 55302 transitions. Second operand 3 states. [2018-11-28 11:20:06,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:06,338 INFO L93 Difference]: Finished difference Result 69644 states and 95752 transitions. [2018-11-28 11:20:06,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:20:06,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-28 11:20:06,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:06,384 INFO L225 Difference]: With dead ends: 69644 [2018-11-28 11:20:06,384 INFO L226 Difference]: Without dead ends: 69642 [2018-11-28 11:20:06,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:06,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69642 states. [2018-11-28 11:20:06,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69642 to 61448. [2018-11-28 11:20:06,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61448 states. [2018-11-28 11:20:07,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61448 states to 61448 states and 80390 transitions. [2018-11-28 11:20:07,015 INFO L78 Accepts]: Start accepts. Automaton has 61448 states and 80390 transitions. Word has length 34 [2018-11-28 11:20:07,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:07,015 INFO L480 AbstractCegarLoop]: Abstraction has 61448 states and 80390 transitions. [2018-11-28 11:20:07,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:20:07,015 INFO L276 IsEmpty]: Start isEmpty. Operand 61448 states and 80390 transitions. [2018-11-28 11:20:07,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 11:20:07,037 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:07,037 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:07,037 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:07,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:07,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1399213004, now seen corresponding path program 1 times [2018-11-28 11:20:07,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:07,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:07,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:07,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:07,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:07,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:20:07,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:07,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:20:07,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:20:07,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:20:07,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:07,068 INFO L87 Difference]: Start difference. First operand 61448 states and 80390 transitions. Second operand 3 states. [2018-11-28 11:20:07,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:07,862 INFO L93 Difference]: Finished difference Result 140300 states and 183816 transitions. [2018-11-28 11:20:07,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:20:07,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-28 11:20:07,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:07,912 INFO L225 Difference]: With dead ends: 140300 [2018-11-28 11:20:07,912 INFO L226 Difference]: Without dead ends: 79882 [2018-11-28 11:20:07,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:07,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79882 states. [2018-11-28 11:20:08,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79882 to 79880. [2018-11-28 11:20:08,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79880 states. [2018-11-28 11:20:08,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79880 states to 79880 states and 103430 transitions. [2018-11-28 11:20:08,874 INFO L78 Accepts]: Start accepts. Automaton has 79880 states and 103430 transitions. Word has length 34 [2018-11-28 11:20:08,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:08,875 INFO L480 AbstractCegarLoop]: Abstraction has 79880 states and 103430 transitions. [2018-11-28 11:20:08,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:20:08,875 INFO L276 IsEmpty]: Start isEmpty. Operand 79880 states and 103430 transitions. [2018-11-28 11:20:09,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 11:20:09,135 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:09,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:09,135 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:09,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:09,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1568430036, now seen corresponding path program 1 times [2018-11-28 11:20:09,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:09,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:09,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:09,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:09,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:09,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:20:09,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:09,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:20:09,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:20:09,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:20:09,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:09,165 INFO L87 Difference]: Start difference. First operand 79880 states and 103430 transitions. Second operand 3 states. [2018-11-28 11:20:09,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:09,774 INFO L93 Difference]: Finished difference Result 119820 states and 154632 transitions. [2018-11-28 11:20:09,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:20:09,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-28 11:20:09,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:09,828 INFO L225 Difference]: With dead ends: 119820 [2018-11-28 11:20:09,828 INFO L226 Difference]: Without dead ends: 80906 [2018-11-28 11:20:09,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:09,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80906 states. [2018-11-28 11:20:10,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80906 to 80904. [2018-11-28 11:20:10,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80904 states. [2018-11-28 11:20:11,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80904 states to 80904 states and 103430 transitions. [2018-11-28 11:20:11,023 INFO L78 Accepts]: Start accepts. Automaton has 80904 states and 103430 transitions. Word has length 35 [2018-11-28 11:20:11,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:11,023 INFO L480 AbstractCegarLoop]: Abstraction has 80904 states and 103430 transitions. [2018-11-28 11:20:11,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:20:11,023 INFO L276 IsEmpty]: Start isEmpty. Operand 80904 states and 103430 transitions. [2018-11-28 11:20:11,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 11:20:11,044 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:11,044 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:11,045 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:11,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:11,045 INFO L82 PathProgramCache]: Analyzing trace with hash -425714670, now seen corresponding path program 1 times [2018-11-28 11:20:11,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:11,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:11,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:11,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:11,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:11,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:20:11,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:11,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:20:11,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:20:11,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:20:11,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:11,072 INFO L87 Difference]: Start difference. First operand 80904 states and 103430 transitions. Second operand 3 states. [2018-11-28 11:20:12,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:12,080 INFO L93 Difference]: Finished difference Result 135180 states and 175112 transitions. [2018-11-28 11:20:12,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:20:12,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-28 11:20:12,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:12,176 INFO L225 Difference]: With dead ends: 135180 [2018-11-28 11:20:12,176 INFO L226 Difference]: Without dead ends: 135178 [2018-11-28 11:20:12,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:12,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135178 states. [2018-11-28 11:20:13,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135178 to 122888. [2018-11-28 11:20:13,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122888 states. [2018-11-28 11:20:13,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122888 states to 122888 states and 152582 transitions. [2018-11-28 11:20:13,695 INFO L78 Accepts]: Start accepts. Automaton has 122888 states and 152582 transitions. Word has length 35 [2018-11-28 11:20:13,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:13,695 INFO L480 AbstractCegarLoop]: Abstraction has 122888 states and 152582 transitions. [2018-11-28 11:20:13,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:20:13,695 INFO L276 IsEmpty]: Start isEmpty. Operand 122888 states and 152582 transitions. [2018-11-28 11:20:13,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 11:20:13,739 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:13,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:13,739 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:13,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:13,739 INFO L82 PathProgramCache]: Analyzing trace with hash -2014062572, now seen corresponding path program 1 times [2018-11-28 11:20:13,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:13,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:13,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:13,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:13,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:13,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:20:13,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:13,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:20:13,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:20:13,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:20:13,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:13,780 INFO L87 Difference]: Start difference. First operand 122888 states and 152582 transitions. Second operand 3 states. [2018-11-28 11:20:15,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:15,140 INFO L93 Difference]: Finished difference Result 278540 states and 345096 transitions. [2018-11-28 11:20:15,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:20:15,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-28 11:20:15,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:15,281 INFO L225 Difference]: With dead ends: 278540 [2018-11-28 11:20:15,281 INFO L226 Difference]: Without dead ends: 157706 [2018-11-28 11:20:15,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:15,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157706 states. [2018-11-28 11:20:17,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157706 to 157704. [2018-11-28 11:20:17,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157704 states. [2018-11-28 11:20:17,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157704 states to 157704 states and 192518 transitions. [2018-11-28 11:20:17,461 INFO L78 Accepts]: Start accepts. Automaton has 157704 states and 192518 transitions. Word has length 35 [2018-11-28 11:20:17,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:17,462 INFO L480 AbstractCegarLoop]: Abstraction has 157704 states and 192518 transitions. [2018-11-28 11:20:17,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:20:17,462 INFO L276 IsEmpty]: Start isEmpty. Operand 157704 states and 192518 transitions. [2018-11-28 11:20:17,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 11:20:17,518 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:17,518 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:17,518 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:17,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:17,518 INFO L82 PathProgramCache]: Analyzing trace with hash -312037047, now seen corresponding path program 1 times [2018-11-28 11:20:17,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:17,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:17,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:17,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:17,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:17,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:20:17,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:17,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:20:17,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:20:17,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:20:17,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:17,545 INFO L87 Difference]: Start difference. First operand 157704 states and 192518 transitions. Second operand 3 states. [2018-11-28 11:20:18,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:18,863 INFO L93 Difference]: Finished difference Result 236556 states and 287752 transitions. [2018-11-28 11:20:18,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:20:18,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-28 11:20:18,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:18,991 INFO L225 Difference]: With dead ends: 236556 [2018-11-28 11:20:18,991 INFO L226 Difference]: Without dead ends: 159754 [2018-11-28 11:20:19,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:19,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159754 states. [2018-11-28 11:20:22,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159754 to 159752. [2018-11-28 11:20:22,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159752 states. [2018-11-28 11:20:22,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159752 states to 159752 states and 192518 transitions. [2018-11-28 11:20:22,785 INFO L78 Accepts]: Start accepts. Automaton has 159752 states and 192518 transitions. Word has length 36 [2018-11-28 11:20:22,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:22,785 INFO L480 AbstractCegarLoop]: Abstraction has 159752 states and 192518 transitions. [2018-11-28 11:20:22,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:20:22,785 INFO L276 IsEmpty]: Start isEmpty. Operand 159752 states and 192518 transitions. [2018-11-28 11:20:22,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 11:20:22,833 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:22,833 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:22,833 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:22,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:22,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1988785543, now seen corresponding path program 1 times [2018-11-28 11:20:22,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:22,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:22,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:22,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:22,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:22,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:20:22,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:22,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:20:22,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:20:22,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:20:22,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:22,857 INFO L87 Difference]: Start difference. First operand 159752 states and 192518 transitions. Second operand 3 states. [2018-11-28 11:20:25,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:25,262 INFO L93 Difference]: Finished difference Result 262156 states and 317448 transitions. [2018-11-28 11:20:25,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:20:25,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-28 11:20:25,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:25,442 INFO L225 Difference]: With dead ends: 262156 [2018-11-28 11:20:25,442 INFO L226 Difference]: Without dead ends: 262154 [2018-11-28 11:20:25,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:25,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262154 states. [2018-11-28 11:20:27,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262154 to 245768. [2018-11-28 11:20:27,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245768 states. [2018-11-28 11:20:28,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245768 states to 245768 states and 288774 transitions. [2018-11-28 11:20:28,565 INFO L78 Accepts]: Start accepts. Automaton has 245768 states and 288774 transitions. Word has length 36 [2018-11-28 11:20:28,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:28,565 INFO L480 AbstractCegarLoop]: Abstraction has 245768 states and 288774 transitions. [2018-11-28 11:20:28,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:20:28,565 INFO L276 IsEmpty]: Start isEmpty. Operand 245768 states and 288774 transitions. [2018-11-28 11:20:28,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 11:20:28,671 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:28,671 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:28,671 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:28,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:28,671 INFO L82 PathProgramCache]: Analyzing trace with hash 400437641, now seen corresponding path program 1 times [2018-11-28 11:20:28,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:28,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:28,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:28,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:28,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:28,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:20:28,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:28,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:20:28,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:20:28,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:20:28,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:28,708 INFO L87 Difference]: Start difference. First operand 245768 states and 288774 transitions. Second operand 3 states. [2018-11-28 11:20:31,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:31,477 INFO L93 Difference]: Finished difference Result 552972 states and 645128 transitions. [2018-11-28 11:20:31,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:20:31,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-28 11:20:31,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:31,769 INFO L225 Difference]: With dead ends: 552972 [2018-11-28 11:20:31,769 INFO L226 Difference]: Without dead ends: 311306 [2018-11-28 11:20:31,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:32,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311306 states. [2018-11-28 11:20:36,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311306 to 311304. [2018-11-28 11:20:36,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311304 states. [2018-11-28 11:20:36,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311304 states to 311304 states and 356358 transitions. [2018-11-28 11:20:36,367 INFO L78 Accepts]: Start accepts. Automaton has 311304 states and 356358 transitions. Word has length 36 [2018-11-28 11:20:36,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:36,367 INFO L480 AbstractCegarLoop]: Abstraction has 311304 states and 356358 transitions. [2018-11-28 11:20:36,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:20:36,367 INFO L276 IsEmpty]: Start isEmpty. Operand 311304 states and 356358 transitions. [2018-11-28 11:20:38,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 11:20:38,876 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:38,876 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:38,876 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:38,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:38,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1523025865, now seen corresponding path program 1 times [2018-11-28 11:20:38,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:38,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:38,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:38,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:38,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:20:38,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:38,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:20:38,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:20:38,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:20:38,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:38,909 INFO L87 Difference]: Start difference. First operand 311304 states and 356358 transitions. Second operand 3 states. [2018-11-28 11:20:41,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:41,602 INFO L93 Difference]: Finished difference Result 466956 states and 532488 transitions. [2018-11-28 11:20:41,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:20:41,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-28 11:20:41,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:41,871 INFO L225 Difference]: With dead ends: 466956 [2018-11-28 11:20:41,871 INFO L226 Difference]: Without dead ends: 315402 [2018-11-28 11:20:41,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:42,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315402 states. [2018-11-28 11:20:45,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315402 to 315400. [2018-11-28 11:20:45,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315400 states. [2018-11-28 11:20:46,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315400 states to 315400 states and 356358 transitions. [2018-11-28 11:20:46,736 INFO L78 Accepts]: Start accepts. Automaton has 315400 states and 356358 transitions. Word has length 37 [2018-11-28 11:20:46,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:20:46,736 INFO L480 AbstractCegarLoop]: Abstraction has 315400 states and 356358 transitions. [2018-11-28 11:20:46,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:20:46,736 INFO L276 IsEmpty]: Start isEmpty. Operand 315400 states and 356358 transitions. [2018-11-28 11:20:46,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 11:20:46,846 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:20:46,846 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:20:46,846 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:20:46,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:20:46,846 INFO L82 PathProgramCache]: Analyzing trace with hash -471118841, now seen corresponding path program 1 times [2018-11-28 11:20:46,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:20:46,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:20:46,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:46,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:20:46,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:20:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:20:46,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:20:46,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:20:46,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:20:46,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:20:46,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:20:46,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:46,889 INFO L87 Difference]: Start difference. First operand 315400 states and 356358 transitions. Second operand 3 states. [2018-11-28 11:20:51,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:20:51,890 INFO L93 Difference]: Finished difference Result 507914 states and 569351 transitions. [2018-11-28 11:20:51,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:20:51,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-28 11:20:51,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:20:52,279 INFO L225 Difference]: With dead ends: 507914 [2018-11-28 11:20:52,279 INFO L226 Difference]: Without dead ends: 507912 [2018-11-28 11:20:52,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:20:52,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507912 states. [2018-11-28 11:21:00,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507912 to 491528. [2018-11-28 11:21:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491528 states. [2018-11-28 11:21:01,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491528 states to 491528 states and 544774 transitions. [2018-11-28 11:21:01,048 INFO L78 Accepts]: Start accepts. Automaton has 491528 states and 544774 transitions. Word has length 37 [2018-11-28 11:21:01,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:21:01,048 INFO L480 AbstractCegarLoop]: Abstraction has 491528 states and 544774 transitions. [2018-11-28 11:21:01,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:21:01,048 INFO L276 IsEmpty]: Start isEmpty. Operand 491528 states and 544774 transitions. [2018-11-28 11:21:01,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 11:21:01,259 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:21:01,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:21:01,259 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:21:01,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:21:01,259 INFO L82 PathProgramCache]: Analyzing trace with hash -2059466743, now seen corresponding path program 1 times [2018-11-28 11:21:01,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:21:01,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:21:01,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:01,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:21:01,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:21:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:21:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:21:01,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:21:01,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:21:01,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:21:01,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:21:01,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:21:01,284 INFO L87 Difference]: Start difference. First operand 491528 states and 544774 transitions. Second operand 3 states. [2018-11-28 11:21:07,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:21:07,689 INFO L93 Difference]: Finished difference Result 1097736 states and 1200134 transitions. [2018-11-28 11:21:07,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:21:07,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-28 11:21:07,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:21:07,690 INFO L225 Difference]: With dead ends: 1097736 [2018-11-28 11:21:07,690 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 11:21:08,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:21:08,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 11:21:08,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 11:21:08,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 11:21:08,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 11:21:08,028 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-11-28 11:21:08,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:21:08,028 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:21:08,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:21:08,028 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:21:08,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 11:21:08,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 11:21:08,090 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 11:21:08,090 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 11:21:08,090 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 11:21:08,090 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 11:21:08,090 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 11:21:08,090 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 11:21:08,090 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 219) no Hoare annotation was computed. [2018-11-28 11:21:08,090 INFO L448 ceAbstractionStarter]: For program point L184-1(lines 51 214) no Hoare annotation was computed. [2018-11-28 11:21:08,090 INFO L448 ceAbstractionStarter]: For program point L118-1(lines 51 214) no Hoare annotation was computed. [2018-11-28 11:21:08,090 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 51 214) no Hoare annotation was computed. [2018-11-28 11:21:08,090 INFO L448 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2018-11-28 11:21:08,091 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2018-11-28 11:21:08,091 INFO L448 ceAbstractionStarter]: For program point L53(lines 53 55) no Hoare annotation was computed. [2018-11-28 11:21:08,091 INFO L448 ceAbstractionStarter]: For program point L86-2(lines 51 214) no Hoare annotation was computed. [2018-11-28 11:21:08,091 INFO L448 ceAbstractionStarter]: For program point L169-1(lines 51 214) no Hoare annotation was computed. [2018-11-28 11:21:08,091 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 219) no Hoare annotation was computed. [2018-11-28 11:21:08,091 INFO L448 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2018-11-28 11:21:08,091 INFO L448 ceAbstractionStarter]: For program point L154-1(lines 51 214) no Hoare annotation was computed. [2018-11-28 11:21:08,091 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 51 214) no Hoare annotation was computed. [2018-11-28 11:21:08,091 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 51 214) no Hoare annotation was computed. [2018-11-28 11:21:08,091 INFO L448 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2018-11-28 11:21:08,091 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 51 214) no Hoare annotation was computed. [2018-11-28 11:21:08,091 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-11-28 11:21:08,091 INFO L448 ceAbstractionStarter]: For program point L106-1(lines 51 214) no Hoare annotation was computed. [2018-11-28 11:21:08,091 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 51 214) no Hoare annotation was computed. [2018-11-28 11:21:08,092 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2018-11-28 11:21:08,092 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 51 214) no Hoare annotation was computed. [2018-11-28 11:21:08,092 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-28 11:21:08,092 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 51 214) no Hoare annotation was computed. [2018-11-28 11:21:08,092 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-28 11:21:08,092 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 51 214) no Hoare annotation was computed. [2018-11-28 11:21:08,092 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 51 214) no Hoare annotation was computed. [2018-11-28 11:21:08,092 INFO L451 ceAbstractionStarter]: At program point L209-1(lines 51 214) the Hoare annotation is: true [2018-11-28 11:21:08,092 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 51 214) no Hoare annotation was computed. [2018-11-28 11:21:08,092 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-28 11:21:08,092 INFO L448 ceAbstractionStarter]: For program point L94-1(lines 51 214) no Hoare annotation was computed. [2018-11-28 11:21:08,092 INFO L448 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2018-11-28 11:21:08,092 INFO L444 ceAbstractionStarter]: At program point L210-1(lines 5 219) the Hoare annotation is: false [2018-11-28 11:21:08,092 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 51 214) no Hoare annotation was computed. [2018-11-28 11:21:08,093 INFO L448 ceAbstractionStarter]: For program point L194-1(lines 51 214) no Hoare annotation was computed. [2018-11-28 11:21:08,093 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-28 11:21:08,093 INFO L448 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-11-28 11:21:08,093 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 219) the Hoare annotation is: true [2018-11-28 11:21:08,093 INFO L448 ceAbstractionStarter]: For program point L179-1(lines 51 214) no Hoare annotation was computed. [2018-11-28 11:21:08,093 INFO L448 ceAbstractionStarter]: For program point L130-1(lines 51 214) no Hoare annotation was computed. [2018-11-28 11:21:08,093 INFO L448 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-11-28 11:21:08,093 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 51 214) no Hoare annotation was computed. [2018-11-28 11:21:08,093 INFO L448 ceAbstractionStarter]: For program point L164-1(lines 51 214) no Hoare annotation was computed. [2018-11-28 11:21:08,093 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 51 214) no Hoare annotation was computed. [2018-11-28 11:21:08,093 INFO L448 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-11-28 11:21:08,093 INFO L451 ceAbstractionStarter]: At program point L215(lines 5 219) the Hoare annotation is: true [2018-11-28 11:21:08,093 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 51 214) no Hoare annotation was computed. [2018-11-28 11:21:08,093 INFO L448 ceAbstractionStarter]: For program point L199-1(lines 51 214) no Hoare annotation was computed. [2018-11-28 11:21:08,094 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-28 11:21:08,094 INFO L448 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2018-11-28 11:21:08,094 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 51 214) no Hoare annotation was computed. [2018-11-28 11:21:08,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:21:08 BoogieIcfgContainer [2018-11-28 11:21:08,099 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:21:08,099 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:21:08,099 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:21:08,100 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:21:08,100 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:58" (3/4) ... [2018-11-28 11:21:08,103 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 11:21:08,109 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 11:21:08,109 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 11:21:08,114 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 11:21:08,114 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 11:21:08,115 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 11:21:08,168 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_082f57aa-5eea-408f-8dc4-6947f16158c9/bin-2019/uautomizer/witness.graphml [2018-11-28 11:21:08,168 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:21:08,169 INFO L168 Benchmark]: Toolchain (without parser) took 70331.49 ms. Allocated memory was 1.0 GB in the beginning and 6.3 GB in the end (delta: 5.3 GB). Free memory was 953.3 MB in the beginning and 1.6 GB in the end (delta: -672.0 MB). Peak memory consumption was 4.6 GB. Max. memory is 11.5 GB. [2018-11-28 11:21:08,171 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:21:08,171 INFO L168 Benchmark]: CACSL2BoogieTranslator took 170.96 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.4 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-28 11:21:08,171 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -193.4 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:21:08,171 INFO L168 Benchmark]: Boogie Preprocessor took 20.72 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:21:08,172 INFO L168 Benchmark]: RCFGBuilder took 227.11 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-11-28 11:21:08,172 INFO L168 Benchmark]: TraceAbstraction took 69794.26 ms. Allocated memory was 1.2 GB in the beginning and 6.3 GB in the end (delta: 5.1 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -520.2 MB). Peak memory consumption was 4.6 GB. Max. memory is 11.5 GB. [2018-11-28 11:21:08,172 INFO L168 Benchmark]: Witness Printer took 68.93 ms. Allocated memory is still 6.3 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 11.5 GB. [2018-11-28 11:21:08,173 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 170.96 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.4 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -193.4 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.72 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 227.11 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 69794.26 ms. Allocated memory was 1.2 GB in the beginning and 6.3 GB in the end (delta: 5.1 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -520.2 MB). Peak memory consumption was 4.6 GB. Max. memory is 11.5 GB. * Witness Printer took 68.93 ms. Allocated memory is still 6.3 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 217]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 56 locations, 1 error locations. SAFE Result, 69.7s OverallTime, 40 OverallIterations, 1 TraceHistogramMax, 30.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4632 SDtfs, 2311 SDslu, 3194 SDs, 0 SdLazy, 213 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=491528occurred in iteration=39, 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: 34.4s AutomataMinimizationTime, 40 MinimizatonAttempts, 65580 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 16394 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.8s InterpolantComputationTime, 1225 NumberOfCodeBlocks, 1225 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1185 ConstructedInterpolants, 0 QuantifiedInterpolants, 74775 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 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...