./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e359a914-95c2-4b6c-b3c8-cc1908e2e15d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e359a914-95c2-4b6c-b3c8-cc1908e2e15d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e359a914-95c2-4b6c-b3c8-cc1908e2e15d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e359a914-95c2-4b6c-b3c8-cc1908e2e15d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e359a914-95c2-4b6c-b3c8-cc1908e2e15d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e359a914-95c2-4b6c-b3c8-cc1908e2e15d/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f7b0b589689413087c164ce10eb80c902ee4046 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 08:24:16,285 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 08:24:16,286 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 08:24:16,294 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 08:24:16,294 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 08:24:16,294 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 08:24:16,295 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 08:24:16,296 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 08:24:16,297 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 08:24:16,297 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 08:24:16,297 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 08:24:16,297 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 08:24:16,298 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 08:24:16,298 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 08:24:16,299 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 08:24:16,299 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 08:24:16,300 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 08:24:16,300 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 08:24:16,302 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 08:24:16,302 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 08:24:16,303 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 08:24:16,304 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 08:24:16,305 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 08:24:16,305 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 08:24:16,305 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 08:24:16,305 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 08:24:16,306 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 08:24:16,306 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 08:24:16,306 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 08:24:16,307 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 08:24:16,307 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 08:24:16,307 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 08:24:16,307 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 08:24:16,308 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 08:24:16,308 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 08:24:16,308 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 08:24:16,309 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e359a914-95c2-4b6c-b3c8-cc1908e2e15d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 08:24:16,318 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 08:24:16,319 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 08:24:16,319 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 08:24:16,319 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 08:24:16,320 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 08:24:16,320 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 08:24:16,320 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 08:24:16,320 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 08:24:16,321 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 08:24:16,321 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 08:24:16,321 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 08:24:16,321 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 08:24:16,321 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 08:24:16,321 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 08:24:16,321 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 08:24:16,322 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 08:24:16,322 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 08:24:16,322 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 08:24:16,322 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 08:24:16,322 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 08:24:16,322 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 08:24:16,323 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 08:24:16,323 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 08:24:16,323 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 08:24:16,323 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 08:24:16,323 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 08:24:16,323 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 08:24:16,323 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 08:24:16,324 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 08:24:16,324 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 08:24:16,324 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_e359a914-95c2-4b6c-b3c8-cc1908e2e15d/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f7b0b589689413087c164ce10eb80c902ee4046 [2018-12-08 08:24:16,348 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 08:24:16,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 08:24:16,359 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 08:24:16,361 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 08:24:16,361 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 08:24:16,361 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e359a914-95c2-4b6c-b3c8-cc1908e2e15d/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-08 08:24:16,399 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e359a914-95c2-4b6c-b3c8-cc1908e2e15d/bin-2019/uautomizer/data/00abae170/2ddbd88c52e54554a5d76c1dbb790c8e/FLAGb3bd82448 [2018-12-08 08:24:16,747 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 08:24:16,747 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e359a914-95c2-4b6c-b3c8-cc1908e2e15d/sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-08 08:24:16,751 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e359a914-95c2-4b6c-b3c8-cc1908e2e15d/bin-2019/uautomizer/data/00abae170/2ddbd88c52e54554a5d76c1dbb790c8e/FLAGb3bd82448 [2018-12-08 08:24:17,134 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e359a914-95c2-4b6c-b3c8-cc1908e2e15d/bin-2019/uautomizer/data/00abae170/2ddbd88c52e54554a5d76c1dbb790c8e [2018-12-08 08:24:17,137 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 08:24:17,138 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 08:24:17,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 08:24:17,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 08:24:17,141 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 08:24:17,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:24:17" (1/1) ... [2018-12-08 08:24:17,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ec9f2fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:24:17, skipping insertion in model container [2018-12-08 08:24:17,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:24:17" (1/1) ... [2018-12-08 08:24:17,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 08:24:17,163 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 08:24:17,261 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 08:24:17,263 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 08:24:17,277 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 08:24:17,285 INFO L195 MainTranslator]: Completed translation [2018-12-08 08:24:17,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:24:17 WrapperNode [2018-12-08 08:24:17,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 08:24:17,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 08:24:17,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 08:24:17,286 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 08:24:17,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:24:17" (1/1) ... [2018-12-08 08:24:17,294 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:24:17" (1/1) ... [2018-12-08 08:24:17,298 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 08:24:17,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 08:24:17,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 08:24:17,298 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 08:24:17,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:24:17" (1/1) ... [2018-12-08 08:24:17,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:24:17" (1/1) ... [2018-12-08 08:24:17,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:24:17" (1/1) ... [2018-12-08 08:24:17,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:24:17" (1/1) ... [2018-12-08 08:24:17,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:24:17" (1/1) ... [2018-12-08 08:24:17,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:24:17" (1/1) ... [2018-12-08 08:24:17,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:24:17" (1/1) ... [2018-12-08 08:24:17,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 08:24:17,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 08:24:17,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 08:24:17,346 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 08:24:17,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:24:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e359a914-95c2-4b6c-b3c8-cc1908e2e15d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 08:24:17,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 08:24:17,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 08:24:17,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 08:24:17,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 08:24:17,377 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 08:24:17,377 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 08:24:17,521 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 08:24:17,522 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-08 08:24:17,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:24:17 BoogieIcfgContainer [2018-12-08 08:24:17,522 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 08:24:17,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 08:24:17,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 08:24:17,524 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 08:24:17,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 08:24:17" (1/3) ... [2018-12-08 08:24:17,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731f7f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:24:17, skipping insertion in model container [2018-12-08 08:24:17,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:24:17" (2/3) ... [2018-12-08 08:24:17,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731f7f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:24:17, skipping insertion in model container [2018-12-08 08:24:17,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:24:17" (3/3) ... [2018-12-08 08:24:17,526 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-08 08:24:17,532 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 08:24:17,536 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 08:24:17,545 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 08:24:17,561 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 08:24:17,562 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 08:24:17,562 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 08:24:17,562 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 08:24:17,562 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 08:24:17,562 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 08:24:17,562 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 08:24:17,562 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 08:24:17,562 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 08:24:17,572 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-12-08 08:24:17,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 08:24:17,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:17,577 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:17,578 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:17,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:17,581 INFO L82 PathProgramCache]: Analyzing trace with hash -917347053, now seen corresponding path program 1 times [2018-12-08 08:24:17,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:17,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:17,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:17,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:17,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:17,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:17,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:17,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:17,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:17,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:17,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:17,691 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2018-12-08 08:24:17,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:17,717 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2018-12-08 08:24:17,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:17,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-08 08:24:17,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:17,724 INFO L225 Difference]: With dead ends: 87 [2018-12-08 08:24:17,724 INFO L226 Difference]: Without dead ends: 72 [2018-12-08 08:24:17,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:17,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-08 08:24:17,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2018-12-08 08:24:17,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-08 08:24:17,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 89 transitions. [2018-12-08 08:24:17,749 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 89 transitions. Word has length 20 [2018-12-08 08:24:17,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:17,749 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 89 transitions. [2018-12-08 08:24:17,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:17,749 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 89 transitions. [2018-12-08 08:24:17,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 08:24:17,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:17,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:17,750 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:17,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:17,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1504153067, now seen corresponding path program 1 times [2018-12-08 08:24:17,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:17,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:17,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:17,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:17,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:17,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:17,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:17,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:17,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:17,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:17,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:17,783 INFO L87 Difference]: Start difference. First operand 50 states and 89 transitions. Second operand 3 states. [2018-12-08 08:24:17,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:17,806 INFO L93 Difference]: Finished difference Result 117 states and 212 transitions. [2018-12-08 08:24:17,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:17,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-08 08:24:17,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:17,808 INFO L225 Difference]: With dead ends: 117 [2018-12-08 08:24:17,808 INFO L226 Difference]: Without dead ends: 72 [2018-12-08 08:24:17,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:17,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-08 08:24:17,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-12-08 08:24:17,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-08 08:24:17,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 125 transitions. [2018-12-08 08:24:17,815 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 125 transitions. Word has length 20 [2018-12-08 08:24:17,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:17,815 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 125 transitions. [2018-12-08 08:24:17,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:17,816 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 125 transitions. [2018-12-08 08:24:17,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 08:24:17,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:17,816 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:17,816 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:17,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:17,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1627225809, now seen corresponding path program 1 times [2018-12-08 08:24:17,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:17,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:17,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:17,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:17,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:17,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:17,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:17,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:17,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:17,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:17,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:17,840 INFO L87 Difference]: Start difference. First operand 70 states and 125 transitions. Second operand 3 states. [2018-12-08 08:24:17,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:17,853 INFO L93 Difference]: Finished difference Result 108 states and 189 transitions. [2018-12-08 08:24:17,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:17,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-08 08:24:17,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:17,854 INFO L225 Difference]: With dead ends: 108 [2018-12-08 08:24:17,854 INFO L226 Difference]: Without dead ends: 75 [2018-12-08 08:24:17,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:17,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-08 08:24:17,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-12-08 08:24:17,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-08 08:24:17,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 127 transitions. [2018-12-08 08:24:17,859 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 127 transitions. Word has length 21 [2018-12-08 08:24:17,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:17,859 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 127 transitions. [2018-12-08 08:24:17,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:17,859 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2018-12-08 08:24:17,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 08:24:17,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:17,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:17,860 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:17,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:17,860 INFO L82 PathProgramCache]: Analyzing trace with hash 616108559, now seen corresponding path program 1 times [2018-12-08 08:24:17,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:17,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:17,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:17,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:17,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:17,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:17,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:17,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:17,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:17,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:17,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:17,878 INFO L87 Difference]: Start difference. First operand 73 states and 127 transitions. Second operand 3 states. [2018-12-08 08:24:17,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:17,890 INFO L93 Difference]: Finished difference Result 136 states and 240 transitions. [2018-12-08 08:24:17,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:17,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-08 08:24:17,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:17,891 INFO L225 Difference]: With dead ends: 136 [2018-12-08 08:24:17,891 INFO L226 Difference]: Without dead ends: 134 [2018-12-08 08:24:17,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:17,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-08 08:24:17,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2018-12-08 08:24:17,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-08 08:24:17,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 168 transitions. [2018-12-08 08:24:17,900 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 168 transitions. Word has length 21 [2018-12-08 08:24:17,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:17,900 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 168 transitions. [2018-12-08 08:24:17,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:17,900 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 168 transitions. [2018-12-08 08:24:17,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 08:24:17,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:17,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:17,901 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:17,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:17,902 INFO L82 PathProgramCache]: Analyzing trace with hash 29302545, now seen corresponding path program 1 times [2018-12-08 08:24:17,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:17,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:17,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:17,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:17,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:17,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:17,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:17,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:17,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:17,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:17,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:17,918 INFO L87 Difference]: Start difference. First operand 96 states and 168 transitions. Second operand 3 states. [2018-12-08 08:24:17,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:17,937 INFO L93 Difference]: Finished difference Result 224 states and 398 transitions. [2018-12-08 08:24:17,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:17,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-08 08:24:17,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:17,939 INFO L225 Difference]: With dead ends: 224 [2018-12-08 08:24:17,939 INFO L226 Difference]: Without dead ends: 136 [2018-12-08 08:24:17,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:17,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-08 08:24:17,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-12-08 08:24:17,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-08 08:24:17,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 234 transitions. [2018-12-08 08:24:17,948 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 234 transitions. Word has length 21 [2018-12-08 08:24:17,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:17,948 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 234 transitions. [2018-12-08 08:24:17,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:17,948 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 234 transitions. [2018-12-08 08:24:17,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 08:24:17,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:17,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:17,950 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:17,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:17,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1919709866, now seen corresponding path program 1 times [2018-12-08 08:24:17,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:17,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:17,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:17,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:17,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:17,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:17,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:17,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:17,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:17,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:17,983 INFO L87 Difference]: Start difference. First operand 134 states and 234 transitions. Second operand 3 states. [2018-12-08 08:24:17,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:17,991 INFO L93 Difference]: Finished difference Result 201 states and 349 transitions. [2018-12-08 08:24:17,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:17,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-08 08:24:17,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:17,992 INFO L225 Difference]: With dead ends: 201 [2018-12-08 08:24:17,992 INFO L226 Difference]: Without dead ends: 138 [2018-12-08 08:24:17,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:17,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-08 08:24:17,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-12-08 08:24:17,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-08 08:24:17,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 234 transitions. [2018-12-08 08:24:18,000 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 234 transitions. Word has length 22 [2018-12-08 08:24:18,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:18,000 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 234 transitions. [2018-12-08 08:24:18,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:18,000 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 234 transitions. [2018-12-08 08:24:18,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 08:24:18,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:18,000 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:18,001 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:18,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:18,001 INFO L82 PathProgramCache]: Analyzing trace with hash 908592616, now seen corresponding path program 1 times [2018-12-08 08:24:18,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:18,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:18,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:18,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:18,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:18,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:18,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:18,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:18,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:18,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,020 INFO L87 Difference]: Start difference. First operand 136 states and 234 transitions. Second operand 3 states. [2018-12-08 08:24:18,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:18,033 INFO L93 Difference]: Finished difference Result 252 states and 440 transitions. [2018-12-08 08:24:18,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:18,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-08 08:24:18,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:18,035 INFO L225 Difference]: With dead ends: 252 [2018-12-08 08:24:18,035 INFO L226 Difference]: Without dead ends: 250 [2018-12-08 08:24:18,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-12-08 08:24:18,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 184. [2018-12-08 08:24:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-08 08:24:18,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 314 transitions. [2018-12-08 08:24:18,044 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 314 transitions. Word has length 22 [2018-12-08 08:24:18,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:18,044 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 314 transitions. [2018-12-08 08:24:18,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:18,044 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 314 transitions. [2018-12-08 08:24:18,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 08:24:18,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:18,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:18,045 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:18,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:18,046 INFO L82 PathProgramCache]: Analyzing trace with hash 321786602, now seen corresponding path program 1 times [2018-12-08 08:24:18,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:18,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:18,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:18,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:18,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:18,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:18,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:18,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:18,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:18,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,060 INFO L87 Difference]: Start difference. First operand 184 states and 314 transitions. Second operand 3 states. [2018-12-08 08:24:18,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:18,072 INFO L93 Difference]: Finished difference Result 432 states and 744 transitions. [2018-12-08 08:24:18,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:18,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-08 08:24:18,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:18,073 INFO L225 Difference]: With dead ends: 432 [2018-12-08 08:24:18,073 INFO L226 Difference]: Without dead ends: 258 [2018-12-08 08:24:18,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-12-08 08:24:18,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-12-08 08:24:18,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-08 08:24:18,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 434 transitions. [2018-12-08 08:24:18,081 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 434 transitions. Word has length 22 [2018-12-08 08:24:18,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:18,081 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 434 transitions. [2018-12-08 08:24:18,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:18,081 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 434 transitions. [2018-12-08 08:24:18,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 08:24:18,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:18,082 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:18,082 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:18,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:18,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1898185914, now seen corresponding path program 1 times [2018-12-08 08:24:18,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:18,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:18,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:18,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:18,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:18,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:18,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:18,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:18,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:18,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,096 INFO L87 Difference]: Start difference. First operand 256 states and 434 transitions. Second operand 3 states. [2018-12-08 08:24:18,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:18,107 INFO L93 Difference]: Finished difference Result 384 states and 648 transitions. [2018-12-08 08:24:18,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:18,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-08 08:24:18,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:18,109 INFO L225 Difference]: With dead ends: 384 [2018-12-08 08:24:18,109 INFO L226 Difference]: Without dead ends: 262 [2018-12-08 08:24:18,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-12-08 08:24:18,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-12-08 08:24:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-08 08:24:18,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2018-12-08 08:24:18,117 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 23 [2018-12-08 08:24:18,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:18,117 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2018-12-08 08:24:18,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:18,117 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2018-12-08 08:24:18,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 08:24:18,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:18,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:18,118 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:18,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:18,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1385664132, now seen corresponding path program 1 times [2018-12-08 08:24:18,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:18,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:18,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:18,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:18,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:18,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:18,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:18,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:18,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:18,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,136 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand 3 states. [2018-12-08 08:24:18,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:18,152 INFO L93 Difference]: Finished difference Result 476 states and 808 transitions. [2018-12-08 08:24:18,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:18,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-08 08:24:18,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:18,154 INFO L225 Difference]: With dead ends: 476 [2018-12-08 08:24:18,154 INFO L226 Difference]: Without dead ends: 474 [2018-12-08 08:24:18,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-12-08 08:24:18,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 360. [2018-12-08 08:24:18,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-12-08 08:24:18,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 590 transitions. [2018-12-08 08:24:18,164 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 590 transitions. Word has length 23 [2018-12-08 08:24:18,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:18,164 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 590 transitions. [2018-12-08 08:24:18,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:18,165 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 590 transitions. [2018-12-08 08:24:18,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 08:24:18,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:18,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:18,166 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:18,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:18,166 INFO L82 PathProgramCache]: Analyzing trace with hash 798858118, now seen corresponding path program 1 times [2018-12-08 08:24:18,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:18,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:18,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:18,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:18,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:18,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:18,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:18,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:18,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:18,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,183 INFO L87 Difference]: Start difference. First operand 360 states and 590 transitions. Second operand 3 states. [2018-12-08 08:24:18,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:18,199 INFO L93 Difference]: Finished difference Result 844 states and 1392 transitions. [2018-12-08 08:24:18,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:18,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-08 08:24:18,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:18,200 INFO L225 Difference]: With dead ends: 844 [2018-12-08 08:24:18,200 INFO L226 Difference]: Without dead ends: 498 [2018-12-08 08:24:18,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-12-08 08:24:18,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2018-12-08 08:24:18,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-12-08 08:24:18,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 806 transitions. [2018-12-08 08:24:18,211 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 806 transitions. Word has length 23 [2018-12-08 08:24:18,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:18,211 INFO L480 AbstractCegarLoop]: Abstraction has 496 states and 806 transitions. [2018-12-08 08:24:18,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:18,211 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 806 transitions. [2018-12-08 08:24:18,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 08:24:18,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:18,212 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:18,212 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:18,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:18,212 INFO L82 PathProgramCache]: Analyzing trace with hash 6129535, now seen corresponding path program 1 times [2018-12-08 08:24:18,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:18,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:18,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:18,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:18,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:18,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:18,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:18,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:18,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:18,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,224 INFO L87 Difference]: Start difference. First operand 496 states and 806 transitions. Second operand 3 states. [2018-12-08 08:24:18,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:18,244 INFO L93 Difference]: Finished difference Result 744 states and 1204 transitions. [2018-12-08 08:24:18,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:18,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-08 08:24:18,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:18,246 INFO L225 Difference]: With dead ends: 744 [2018-12-08 08:24:18,246 INFO L226 Difference]: Without dead ends: 506 [2018-12-08 08:24:18,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-12-08 08:24:18,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2018-12-08 08:24:18,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-12-08 08:24:18,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 806 transitions. [2018-12-08 08:24:18,256 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 806 transitions. Word has length 24 [2018-12-08 08:24:18,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:18,257 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 806 transitions. [2018-12-08 08:24:18,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:18,257 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 806 transitions. [2018-12-08 08:24:18,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 08:24:18,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:18,258 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:18,258 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:18,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:18,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1004987715, now seen corresponding path program 1 times [2018-12-08 08:24:18,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:18,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:18,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:18,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:18,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:18,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:18,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:18,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:18,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:18,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,271 INFO L87 Difference]: Start difference. First operand 504 states and 806 transitions. Second operand 3 states. [2018-12-08 08:24:18,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:18,294 INFO L93 Difference]: Finished difference Result 908 states and 1480 transitions. [2018-12-08 08:24:18,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:18,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-08 08:24:18,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:18,297 INFO L225 Difference]: With dead ends: 908 [2018-12-08 08:24:18,298 INFO L226 Difference]: Without dead ends: 906 [2018-12-08 08:24:18,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2018-12-08 08:24:18,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 712. [2018-12-08 08:24:18,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2018-12-08 08:24:18,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1110 transitions. [2018-12-08 08:24:18,313 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1110 transitions. Word has length 24 [2018-12-08 08:24:18,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:18,313 INFO L480 AbstractCegarLoop]: Abstraction has 712 states and 1110 transitions. [2018-12-08 08:24:18,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:18,313 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1110 transitions. [2018-12-08 08:24:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 08:24:18,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:18,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:18,314 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:18,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:18,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1591793729, now seen corresponding path program 1 times [2018-12-08 08:24:18,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:18,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:18,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:18,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:18,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:18,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:18,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:18,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:18,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,327 INFO L87 Difference]: Start difference. First operand 712 states and 1110 transitions. Second operand 3 states. [2018-12-08 08:24:18,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:18,356 INFO L93 Difference]: Finished difference Result 1660 states and 2600 transitions. [2018-12-08 08:24:18,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:18,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-08 08:24:18,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:18,359 INFO L225 Difference]: With dead ends: 1660 [2018-12-08 08:24:18,359 INFO L226 Difference]: Without dead ends: 970 [2018-12-08 08:24:18,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2018-12-08 08:24:18,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 968. [2018-12-08 08:24:18,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2018-12-08 08:24:18,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1494 transitions. [2018-12-08 08:24:18,383 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1494 transitions. Word has length 24 [2018-12-08 08:24:18,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:18,383 INFO L480 AbstractCegarLoop]: Abstraction has 968 states and 1494 transitions. [2018-12-08 08:24:18,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:18,383 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1494 transitions. [2018-12-08 08:24:18,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 08:24:18,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:18,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:18,384 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:18,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:18,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1089633349, now seen corresponding path program 1 times [2018-12-08 08:24:18,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:18,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:18,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:18,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:18,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:18,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:18,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:18,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:18,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:18,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,399 INFO L87 Difference]: Start difference. First operand 968 states and 1494 transitions. Second operand 3 states. [2018-12-08 08:24:18,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:18,426 INFO L93 Difference]: Finished difference Result 1452 states and 2232 transitions. [2018-12-08 08:24:18,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:18,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-08 08:24:18,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:18,429 INFO L225 Difference]: With dead ends: 1452 [2018-12-08 08:24:18,430 INFO L226 Difference]: Without dead ends: 986 [2018-12-08 08:24:18,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2018-12-08 08:24:18,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2018-12-08 08:24:18,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2018-12-08 08:24:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1494 transitions. [2018-12-08 08:24:18,459 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1494 transitions. Word has length 25 [2018-12-08 08:24:18,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:18,460 INFO L480 AbstractCegarLoop]: Abstraction has 984 states and 1494 transitions. [2018-12-08 08:24:18,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:18,460 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1494 transitions. [2018-12-08 08:24:18,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 08:24:18,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:18,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:18,461 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:18,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:18,462 INFO L82 PathProgramCache]: Analyzing trace with hash -2100750599, now seen corresponding path program 1 times [2018-12-08 08:24:18,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:18,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:18,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:18,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:18,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:18,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:18,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:18,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:18,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:18,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,476 INFO L87 Difference]: Start difference. First operand 984 states and 1494 transitions. Second operand 3 states. [2018-12-08 08:24:18,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:18,511 INFO L93 Difference]: Finished difference Result 1740 states and 2696 transitions. [2018-12-08 08:24:18,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:18,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-08 08:24:18,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:18,516 INFO L225 Difference]: With dead ends: 1740 [2018-12-08 08:24:18,516 INFO L226 Difference]: Without dead ends: 1738 [2018-12-08 08:24:18,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-12-08 08:24:18,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1416. [2018-12-08 08:24:18,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2018-12-08 08:24:18,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2086 transitions. [2018-12-08 08:24:18,553 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2086 transitions. Word has length 25 [2018-12-08 08:24:18,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:18,553 INFO L480 AbstractCegarLoop]: Abstraction has 1416 states and 2086 transitions. [2018-12-08 08:24:18,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:18,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2086 transitions. [2018-12-08 08:24:18,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 08:24:18,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:18,555 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:18,555 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:18,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:18,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1607410683, now seen corresponding path program 1 times [2018-12-08 08:24:18,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:18,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:18,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:18,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:18,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:18,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:18,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:18,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:18,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:18,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,567 INFO L87 Difference]: Start difference. First operand 1416 states and 2086 transitions. Second operand 3 states. [2018-12-08 08:24:18,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:18,616 INFO L93 Difference]: Finished difference Result 3276 states and 4840 transitions. [2018-12-08 08:24:18,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:18,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-08 08:24:18,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:18,621 INFO L225 Difference]: With dead ends: 3276 [2018-12-08 08:24:18,621 INFO L226 Difference]: Without dead ends: 1898 [2018-12-08 08:24:18,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2018-12-08 08:24:18,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2018-12-08 08:24:18,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2018-12-08 08:24:18,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2758 transitions. [2018-12-08 08:24:18,654 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2758 transitions. Word has length 25 [2018-12-08 08:24:18,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:18,654 INFO L480 AbstractCegarLoop]: Abstraction has 1896 states and 2758 transitions. [2018-12-08 08:24:18,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:18,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2758 transitions. [2018-12-08 08:24:18,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 08:24:18,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:18,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:18,656 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:18,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:18,656 INFO L82 PathProgramCache]: Analyzing trace with hash -698544044, now seen corresponding path program 1 times [2018-12-08 08:24:18,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:18,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:18,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:18,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:18,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:18,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:18,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:18,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:18,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:18,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,671 INFO L87 Difference]: Start difference. First operand 1896 states and 2758 transitions. Second operand 3 states. [2018-12-08 08:24:18,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:18,698 INFO L93 Difference]: Finished difference Result 2844 states and 4120 transitions. [2018-12-08 08:24:18,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:18,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-08 08:24:18,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:18,702 INFO L225 Difference]: With dead ends: 2844 [2018-12-08 08:24:18,702 INFO L226 Difference]: Without dead ends: 1930 [2018-12-08 08:24:18,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2018-12-08 08:24:18,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2018-12-08 08:24:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-12-08 08:24:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2758 transitions. [2018-12-08 08:24:18,737 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2758 transitions. Word has length 26 [2018-12-08 08:24:18,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:18,737 INFO L480 AbstractCegarLoop]: Abstraction has 1928 states and 2758 transitions. [2018-12-08 08:24:18,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:18,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2758 transitions. [2018-12-08 08:24:18,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 08:24:18,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:18,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] [2018-12-08 08:24:18,739 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:18,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:18,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1709661294, now seen corresponding path program 1 times [2018-12-08 08:24:18,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:18,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:18,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:18,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:18,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:18,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:18,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:18,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:18,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:18,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,749 INFO L87 Difference]: Start difference. First operand 1928 states and 2758 transitions. Second operand 3 states. [2018-12-08 08:24:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:18,800 INFO L93 Difference]: Finished difference Result 3340 states and 4872 transitions. [2018-12-08 08:24:18,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:18,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-08 08:24:18,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:18,805 INFO L225 Difference]: With dead ends: 3340 [2018-12-08 08:24:18,805 INFO L226 Difference]: Without dead ends: 3338 [2018-12-08 08:24:18,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2018-12-08 08:24:18,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2824. [2018-12-08 08:24:18,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2018-12-08 08:24:18,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3910 transitions. [2018-12-08 08:24:18,850 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3910 transitions. Word has length 26 [2018-12-08 08:24:18,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:18,850 INFO L480 AbstractCegarLoop]: Abstraction has 2824 states and 3910 transitions. [2018-12-08 08:24:18,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:18,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3910 transitions. [2018-12-08 08:24:18,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 08:24:18,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:18,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:18,853 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:18,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:18,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1998499988, now seen corresponding path program 1 times [2018-12-08 08:24:18,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:18,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:18,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:18,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:18,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-12-08 08:24:18,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:18,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:18,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:18,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:18,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,863 INFO L87 Difference]: Start difference. First operand 2824 states and 3910 transitions. Second operand 3 states. [2018-12-08 08:24:18,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:18,936 INFO L93 Difference]: Finished difference Result 6476 states and 8968 transitions. [2018-12-08 08:24:18,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:18,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-08 08:24:18,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:18,945 INFO L225 Difference]: With dead ends: 6476 [2018-12-08 08:24:18,945 INFO L226 Difference]: Without dead ends: 3722 [2018-12-08 08:24:18,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:18,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2018-12-08 08:24:19,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3720. [2018-12-08 08:24:19,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2018-12-08 08:24:19,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5062 transitions. [2018-12-08 08:24:19,024 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5062 transitions. Word has length 26 [2018-12-08 08:24:19,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:19,025 INFO L480 AbstractCegarLoop]: Abstraction has 3720 states and 5062 transitions. [2018-12-08 08:24:19,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:19,025 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5062 transitions. [2018-12-08 08:24:19,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 08:24:19,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:19,027 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:19,028 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:19,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:19,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1459677136, now seen corresponding path program 1 times [2018-12-08 08:24:19,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:19,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:19,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:19,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:19,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:19,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:19,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:19,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:19,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:19,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:19,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:19,039 INFO L87 Difference]: Start difference. First operand 3720 states and 5062 transitions. Second operand 3 states. [2018-12-08 08:24:19,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:19,091 INFO L93 Difference]: Finished difference Result 5580 states and 7560 transitions. [2018-12-08 08:24:19,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:19,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-08 08:24:19,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:19,097 INFO L225 Difference]: With dead ends: 5580 [2018-12-08 08:24:19,097 INFO L226 Difference]: Without dead ends: 3786 [2018-12-08 08:24:19,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:19,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2018-12-08 08:24:19,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2018-12-08 08:24:19,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2018-12-08 08:24:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5062 transitions. [2018-12-08 08:24:19,168 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5062 transitions. Word has length 27 [2018-12-08 08:24:19,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:19,169 INFO L480 AbstractCegarLoop]: Abstraction has 3784 states and 5062 transitions. [2018-12-08 08:24:19,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:19,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5062 transitions. [2018-12-08 08:24:19,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 08:24:19,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:19,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:19,184 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:19,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:19,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1824172910, now seen corresponding path program 1 times [2018-12-08 08:24:19,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:19,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:19,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:19,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:19,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:19,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:19,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:19,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:19,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:19,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:19,207 INFO L87 Difference]: Start difference. First operand 3784 states and 5062 transitions. Second operand 3 states. [2018-12-08 08:24:19,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:19,316 INFO L93 Difference]: Finished difference Result 10956 states and 14408 transitions. [2018-12-08 08:24:19,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:19,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-08 08:24:19,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:19,327 INFO L225 Difference]: With dead ends: 10956 [2018-12-08 08:24:19,327 INFO L226 Difference]: Without dead ends: 7306 [2018-12-08 08:24:19,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:19,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2018-12-08 08:24:19,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7304. [2018-12-08 08:24:19,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2018-12-08 08:24:19,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9350 transitions. [2018-12-08 08:24:19,440 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9350 transitions. Word has length 27 [2018-12-08 08:24:19,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:19,440 INFO L480 AbstractCegarLoop]: Abstraction has 7304 states and 9350 transitions. [2018-12-08 08:24:19,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:19,440 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9350 transitions. [2018-12-08 08:24:19,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 08:24:19,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:19,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:19,444 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:19,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:19,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1883988372, now seen corresponding path program 1 times [2018-12-08 08:24:19,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:19,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:19,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:19,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:19,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:19,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:19,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:19,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:19,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:19,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:19,453 INFO L87 Difference]: Start difference. First operand 7304 states and 9350 transitions. Second operand 3 states. [2018-12-08 08:24:19,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:19,553 INFO L93 Difference]: Finished difference Result 8076 states and 10632 transitions. [2018-12-08 08:24:19,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:19,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-08 08:24:19,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:19,561 INFO L225 Difference]: With dead ends: 8076 [2018-12-08 08:24:19,561 INFO L226 Difference]: Without dead ends: 8074 [2018-12-08 08:24:19,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:19,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2018-12-08 08:24:19,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 7304. [2018-12-08 08:24:19,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2018-12-08 08:24:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9222 transitions. [2018-12-08 08:24:19,664 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9222 transitions. Word has length 27 [2018-12-08 08:24:19,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:19,664 INFO L480 AbstractCegarLoop]: Abstraction has 7304 states and 9222 transitions. [2018-12-08 08:24:19,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:19,664 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9222 transitions. [2018-12-08 08:24:19,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 08:24:19,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:19,668 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:19,668 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:19,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:19,668 INFO L82 PathProgramCache]: Analyzing trace with hash 715001129, now seen corresponding path program 1 times [2018-12-08 08:24:19,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:19,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:19,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:19,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:19,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:19,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:19,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:19,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:19,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:19,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:19,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:19,679 INFO L87 Difference]: Start difference. First operand 7304 states and 9222 transitions. Second operand 3 states. [2018-12-08 08:24:19,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:19,824 INFO L93 Difference]: Finished difference Result 12172 states and 15496 transitions. [2018-12-08 08:24:19,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:19,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-08 08:24:19,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:19,835 INFO L225 Difference]: With dead ends: 12172 [2018-12-08 08:24:19,835 INFO L226 Difference]: Without dead ends: 12170 [2018-12-08 08:24:19,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:19,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2018-12-08 08:24:19,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11144. [2018-12-08 08:24:19,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2018-12-08 08:24:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 13702 transitions. [2018-12-08 08:24:19,956 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 13702 transitions. Word has length 28 [2018-12-08 08:24:19,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:19,956 INFO L480 AbstractCegarLoop]: Abstraction has 11144 states and 13702 transitions. [2018-12-08 08:24:19,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:19,956 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 13702 transitions. [2018-12-08 08:24:19,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 08:24:19,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:19,963 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:19,963 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:19,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:19,964 INFO L82 PathProgramCache]: Analyzing trace with hash 128195115, now seen corresponding path program 1 times [2018-12-08 08:24:19,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:19,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:19,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:19,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:19,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:19,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:19,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:19,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:19,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:19,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:19,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:19,974 INFO L87 Difference]: Start difference. First operand 11144 states and 13702 transitions. Second operand 3 states. [2018-12-08 08:24:20,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:20,140 INFO L93 Difference]: Finished difference Result 25228 states and 30856 transitions. [2018-12-08 08:24:20,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:20,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-08 08:24:20,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:20,158 INFO L225 Difference]: With dead ends: 25228 [2018-12-08 08:24:20,158 INFO L226 Difference]: Without dead ends: 14218 [2018-12-08 08:24:20,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:20,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2018-12-08 08:24:20,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 14216. [2018-12-08 08:24:20,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2018-12-08 08:24:20,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 16902 transitions. [2018-12-08 08:24:20,399 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 16902 transitions. Word has length 28 [2018-12-08 08:24:20,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:20,399 INFO L480 AbstractCegarLoop]: Abstraction has 14216 states and 16902 transitions. [2018-12-08 08:24:20,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:20,399 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 16902 transitions. [2018-12-08 08:24:20,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-08 08:24:20,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:20,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:20,405 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:20,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:20,405 INFO L82 PathProgramCache]: Analyzing trace with hash 690414627, now seen corresponding path program 1 times [2018-12-08 08:24:20,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:20,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:20,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:20,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:20,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:20,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:20,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:20,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:20,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:20,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:20,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:20,422 INFO L87 Difference]: Start difference. First operand 14216 states and 16902 transitions. Second operand 3 states. [2018-12-08 08:24:20,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:20,539 INFO L93 Difference]: Finished difference Result 21516 states and 25608 transitions. [2018-12-08 08:24:20,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:20,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-08 08:24:20,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:20,553 INFO L225 Difference]: With dead ends: 21516 [2018-12-08 08:24:20,553 INFO L226 Difference]: Without dead ends: 14602 [2018-12-08 08:24:20,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:20,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2018-12-08 08:24:20,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 14600. [2018-12-08 08:24:20,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2018-12-08 08:24:20,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 17158 transitions. [2018-12-08 08:24:20,751 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 17158 transitions. Word has length 29 [2018-12-08 08:24:20,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:20,751 INFO L480 AbstractCegarLoop]: Abstraction has 14600 states and 17158 transitions. [2018-12-08 08:24:20,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:20,752 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 17158 transitions. [2018-12-08 08:24:20,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-08 08:24:20,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:20,758 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:20,758 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:20,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:20,758 INFO L82 PathProgramCache]: Analyzing trace with hash -320702623, now seen corresponding path program 1 times [2018-12-08 08:24:20,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:20,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:20,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:20,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:20,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:20,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:20,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:20,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:20,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:20,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:20,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:20,767 INFO L87 Difference]: Start difference. First operand 14600 states and 17158 transitions. Second operand 3 states. [2018-12-08 08:24:21,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:21,001 INFO L93 Difference]: Finished difference Result 23562 states and 27399 transitions. [2018-12-08 08:24:21,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:21,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-08 08:24:21,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:21,016 INFO L225 Difference]: With dead ends: 23562 [2018-12-08 08:24:21,017 INFO L226 Difference]: Without dead ends: 23560 [2018-12-08 08:24:21,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23560 states. [2018-12-08 08:24:21,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23560 to 22536. [2018-12-08 08:24:21,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22536 states. [2018-12-08 08:24:21,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22536 states to 22536 states and 25862 transitions. [2018-12-08 08:24:21,262 INFO L78 Accepts]: Start accepts. Automaton has 22536 states and 25862 transitions. Word has length 29 [2018-12-08 08:24:21,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:21,263 INFO L480 AbstractCegarLoop]: Abstraction has 22536 states and 25862 transitions. [2018-12-08 08:24:21,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:21,263 INFO L276 IsEmpty]: Start isEmpty. Operand 22536 states and 25862 transitions. [2018-12-08 08:24:21,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-08 08:24:21,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:24:21,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:24:21,272 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:24:21,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:24:21,272 INFO L82 PathProgramCache]: Analyzing trace with hash -907508637, now seen corresponding path program 1 times [2018-12-08 08:24:21,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:24:21,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:24:21,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:21,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:24:21,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:24:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:24:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:24:21,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:24:21,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:24:21,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:24:21,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:24:21,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:21,283 INFO L87 Difference]: Start difference. First operand 22536 states and 25862 transitions. Second operand 3 states. [2018-12-08 08:24:21,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:24:21,557 INFO L93 Difference]: Finished difference Result 50184 states and 56582 transitions. [2018-12-08 08:24:21,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:24:21,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-08 08:24:21,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:24:21,557 INFO L225 Difference]: With dead ends: 50184 [2018-12-08 08:24:21,558 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 08:24:21,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:24:21,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 08:24:21,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 08:24:21,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 08:24:21,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 08:24:21,590 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-12-08 08:24:21,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:24:21,590 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 08:24:21,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:24:21,590 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 08:24:21,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 08:24:21,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-08 08:24:21,615 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-08 08:24:21,615 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-08 08:24:21,615 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-08 08:24:21,615 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-08 08:24:21,615 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-08 08:24:21,615 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-08 08:24:21,616 INFO L451 ceAbstractionStarter]: At program point L159(lines 5 163) the Hoare annotation is: true [2018-12-08 08:24:21,616 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 163) no Hoare annotation was computed. [2018-12-08 08:24:21,616 INFO L448 ceAbstractionStarter]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2018-12-08 08:24:21,616 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2018-12-08 08:24:21,616 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2018-12-08 08:24:21,616 INFO L448 ceAbstractionStarter]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2018-12-08 08:24:21,616 INFO L448 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2018-12-08 08:24:21,616 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2018-12-08 08:24:21,616 INFO L448 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-12-08 08:24:21,616 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2018-12-08 08:24:21,616 INFO L448 ceAbstractionStarter]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2018-12-08 08:24:21,616 INFO L448 ceAbstractionStarter]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2018-12-08 08:24:21,616 INFO L451 ceAbstractionStarter]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2018-12-08 08:24:21,616 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 163) no Hoare annotation was computed. [2018-12-08 08:24:21,617 INFO L448 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-12-08 08:24:21,617 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 163) the Hoare annotation is: true [2018-12-08 08:24:21,617 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-12-08 08:24:21,617 INFO L444 ceAbstractionStarter]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2018-12-08 08:24:21,617 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2018-12-08 08:24:21,617 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2018-12-08 08:24:21,617 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2018-12-08 08:24:21,617 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-12-08 08:24:21,617 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-12-08 08:24:21,617 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2018-12-08 08:24:21,617 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2018-12-08 08:24:21,617 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2018-12-08 08:24:21,618 INFO L448 ceAbstractionStarter]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2018-12-08 08:24:21,618 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2018-12-08 08:24:21,618 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2018-12-08 08:24:21,618 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2018-12-08 08:24:21,618 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-12-08 08:24:21,618 INFO L448 ceAbstractionStarter]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2018-12-08 08:24:21,618 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-12-08 08:24:21,618 INFO L448 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2018-12-08 08:24:21,618 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2018-12-08 08:24:21,618 INFO L448 ceAbstractionStarter]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2018-12-08 08:24:21,618 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-12-08 08:24:21,618 INFO L448 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2018-12-08 08:24:21,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 08:24:21 BoogieIcfgContainer [2018-12-08 08:24:21,624 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 08:24:21,624 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 08:24:21,624 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 08:24:21,624 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 08:24:21,625 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:24:17" (3/4) ... [2018-12-08 08:24:21,627 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 08:24:21,631 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 08:24:21,632 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 08:24:21,635 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-08 08:24:21,635 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-08 08:24:21,635 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-08 08:24:21,674 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e359a914-95c2-4b6c-b3c8-cc1908e2e15d/bin-2019/uautomizer/witness.graphml [2018-12-08 08:24:21,674 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 08:24:21,675 INFO L168 Benchmark]: Toolchain (without parser) took 4537.47 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 498.1 MB). Free memory was 953.3 MB in the beginning and 1.3 GB in the end (delta: -333.5 MB). Peak memory consumption was 164.6 MB. Max. memory is 11.5 GB. [2018-12-08 08:24:21,676 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:24:21,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 147.16 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 08:24:21,676 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.23 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 08:24:21,676 INFO L168 Benchmark]: Boogie Preprocessor took 46.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-12-08 08:24:21,677 INFO L168 Benchmark]: RCFGBuilder took 176.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-08 08:24:21,677 INFO L168 Benchmark]: TraceAbstraction took 4101.46 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 393.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -210.3 MB). Peak memory consumption was 183.5 MB. Max. memory is 11.5 GB. [2018-12-08 08:24:21,677 INFO L168 Benchmark]: Witness Printer took 49.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 769.1 kB). Peak memory consumption was 769.1 kB. Max. memory is 11.5 GB. [2018-12-08 08:24:21,679 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 147.16 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.23 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 176.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4101.46 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 393.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -210.3 MB). Peak memory consumption was 183.5 MB. Max. memory is 11.5 GB. * Witness Printer took 49.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 769.1 kB). Peak memory consumption was 769.1 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 1 error locations. SAFE Result, 4.0s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2384 SDtfs, 1153 SDslu, 1624 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22536occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 1034 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 659 ConstructedInterpolants, 0 QuantifiedInterpolants, 31265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...