./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ff709d9f-457d-4c56-b5e1-c4008b9f2652/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ff709d9f-457d-4c56-b5e1-c4008b9f2652/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ff709d9f-457d-4c56-b5e1-c4008b9f2652/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ff709d9f-457d-4c56-b5e1-c4008b9f2652/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_12.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ff709d9f-457d-4c56-b5e1-c4008b9f2652/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ff709d9f-457d-4c56-b5e1-c4008b9f2652/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:25:57,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:25:57,484 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:25:57,491 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:25:57,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:25:57,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:25:57,493 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:25:57,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:25:57,496 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:25:57,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:25:57,497 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:25:57,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:25:57,498 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:25:57,499 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:25:57,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:25:57,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:25:57,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:25:57,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:25:57,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:25:57,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:25:57,505 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:25:57,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:25:57,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:25:57,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:25:57,508 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:25:57,508 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:25:57,509 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:25:57,509 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:25:57,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:25:57,510 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:25:57,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:25:57,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:25:57,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:25:57,511 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:25:57,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:25:57,512 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:25:57,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:25:57,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:25:57,513 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:25:57,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:25:57,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:25:57,514 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ff709d9f-457d-4c56-b5e1-c4008b9f2652/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:25:57,523 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:25:57,524 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:25:57,524 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:25:57,525 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:25:57,525 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:25:57,525 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:25:57,525 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:25:57,525 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:25:57,525 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:25:57,525 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:25:57,525 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:25:57,526 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:25:57,526 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:25:57,526 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:25:57,526 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:25:57,526 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:25:57,526 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:25:57,526 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:25:57,527 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:25:57,527 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:25:57,527 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:25:57,527 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:25:57,527 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:25:57,527 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:25:57,527 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:25:57,527 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:25:57,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:25:57,528 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:25:57,528 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:25:57,528 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_ff709d9f-457d-4c56-b5e1-c4008b9f2652/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 [2019-12-07 18:25:57,626 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:25:57,633 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:25:57,635 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:25:57,636 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:25:57,637 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:25:57,637 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ff709d9f-457d-4c56-b5e1-c4008b9f2652/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_12.c [2019-12-07 18:25:57,674 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ff709d9f-457d-4c56-b5e1-c4008b9f2652/bin/uautomizer/data/d5dd3aaaf/dd541ce2eab747d6af479fd675c71df2/FLAGd3c228724 [2019-12-07 18:25:58,061 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:25:58,062 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ff709d9f-457d-4c56-b5e1-c4008b9f2652/sv-benchmarks/c/locks/test_locks_12.c [2019-12-07 18:25:58,068 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ff709d9f-457d-4c56-b5e1-c4008b9f2652/bin/uautomizer/data/d5dd3aaaf/dd541ce2eab747d6af479fd675c71df2/FLAGd3c228724 [2019-12-07 18:25:58,077 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ff709d9f-457d-4c56-b5e1-c4008b9f2652/bin/uautomizer/data/d5dd3aaaf/dd541ce2eab747d6af479fd675c71df2 [2019-12-07 18:25:58,079 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:25:58,080 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:25:58,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:25:58,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:25:58,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:25:58,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:25:58" (1/1) ... [2019-12-07 18:25:58,086 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@374ca533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:58, skipping insertion in model container [2019-12-07 18:25:58,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:25:58" (1/1) ... [2019-12-07 18:25:58,091 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:25:58,107 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:25:58,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:25:58,261 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:25:58,278 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:25:58,287 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:25:58,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:58 WrapperNode [2019-12-07 18:25:58,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:25:58,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:25:58,288 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:25:58,288 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:25:58,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:58" (1/1) ... [2019-12-07 18:25:58,297 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:58" (1/1) ... [2019-12-07 18:25:58,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:25:58,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:25:58,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:25:58,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:25:58,318 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:58" (1/1) ... [2019-12-07 18:25:58,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:58" (1/1) ... [2019-12-07 18:25:58,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:58" (1/1) ... [2019-12-07 18:25:58,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:58" (1/1) ... [2019-12-07 18:25:58,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:58" (1/1) ... [2019-12-07 18:25:58,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:58" (1/1) ... [2019-12-07 18:25:58,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:58" (1/1) ... [2019-12-07 18:25:58,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:25:58,329 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:25:58,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:25:58,329 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:25:58,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff709d9f-457d-4c56-b5e1-c4008b9f2652/bin/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 [2019-12-07 18:25:58,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:25:58,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:25:58,553 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:25:58,554 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-12-07 18:25:58,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:25:58 BoogieIcfgContainer [2019-12-07 18:25:58,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:25:58,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:25:58,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:25:58,557 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:25:58,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:25:58" (1/3) ... [2019-12-07 18:25:58,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eff63b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:25:58, skipping insertion in model container [2019-12-07 18:25:58,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:25:58" (2/3) ... [2019-12-07 18:25:58,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eff63b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:25:58, skipping insertion in model container [2019-12-07 18:25:58,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:25:58" (3/3) ... [2019-12-07 18:25:58,559 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2019-12-07 18:25:58,567 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:25:58,571 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:25:58,579 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 18:25:58,593 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:25:58,593 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:25:58,593 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:25:58,593 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:25:58,593 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:25:58,593 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:25:58,594 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:25:58,594 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:25:58,603 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-12-07 18:25:58,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:25:58,607 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:58,607 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:58,608 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:58,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:58,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1363603929, now seen corresponding path program 1 times [2019-12-07 18:25:58,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:58,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612481340] [2019-12-07 18:25:58,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:58,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:58,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612481340] [2019-12-07 18:25:58,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:58,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:25:58,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072440294] [2019-12-07 18:25:58,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:25:58,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:58,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:25:58,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:25:58,751 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2019-12-07 18:25:58,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:58,783 INFO L93 Difference]: Finished difference Result 94 states and 168 transitions. [2019-12-07 18:25:58,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:58,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 18:25:58,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:58,791 INFO L225 Difference]: With dead ends: 94 [2019-12-07 18:25:58,791 INFO L226 Difference]: Without dead ends: 80 [2019-12-07 18:25:58,793 INFO L630 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 [2019-12-07 18:25:58,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-12-07 18:25:58,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 54. [2019-12-07 18:25:58,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 18:25:58,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 101 transitions. [2019-12-07 18:25:58,820 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 101 transitions. Word has length 18 [2019-12-07 18:25:58,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:58,820 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 101 transitions. [2019-12-07 18:25:58,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:25:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 101 transitions. [2019-12-07 18:25:58,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:25:58,821 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:58,821 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:58,821 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:58,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:58,821 INFO L82 PathProgramCache]: Analyzing trace with hash 83740251, now seen corresponding path program 1 times [2019-12-07 18:25:58,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:58,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004772471] [2019-12-07 18:25:58,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:58,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:58,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004772471] [2019-12-07 18:25:58,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:58,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:25:58,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729394020] [2019-12-07 18:25:58,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:25:58,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:58,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:25:58,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:25:58,859 INFO L87 Difference]: Start difference. First operand 54 states and 101 transitions. Second operand 3 states. [2019-12-07 18:25:58,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:58,877 INFO L93 Difference]: Finished difference Result 133 states and 248 transitions. [2019-12-07 18:25:58,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:58,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 18:25:58,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:58,879 INFO L225 Difference]: With dead ends: 133 [2019-12-07 18:25:58,879 INFO L226 Difference]: Without dead ends: 80 [2019-12-07 18:25:58,880 INFO L630 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 [2019-12-07 18:25:58,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-12-07 18:25:58,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-12-07 18:25:58,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 18:25:58,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 145 transitions. [2019-12-07 18:25:58,887 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 145 transitions. Word has length 18 [2019-12-07 18:25:58,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:58,888 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 145 transitions. [2019-12-07 18:25:58,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:25:58,888 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 145 transitions. [2019-12-07 18:25:58,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:25:58,888 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:58,889 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:58,889 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:58,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:58,889 INFO L82 PathProgramCache]: Analyzing trace with hash -677738462, now seen corresponding path program 1 times [2019-12-07 18:25:58,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:58,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329006084] [2019-12-07 18:25:58,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:58,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:58,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329006084] [2019-12-07 18:25:58,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:58,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:25:58,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254383646] [2019-12-07 18:25:58,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:25:58,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:58,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:25:58,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:25:58,919 INFO L87 Difference]: Start difference. First operand 78 states and 145 transitions. Second operand 3 states. [2019-12-07 18:25:58,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:58,931 INFO L93 Difference]: Finished difference Result 122 states and 221 transitions. [2019-12-07 18:25:58,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:58,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 18:25:58,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:58,932 INFO L225 Difference]: With dead ends: 122 [2019-12-07 18:25:58,932 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 18:25:58,932 INFO L630 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 [2019-12-07 18:25:58,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 18:25:58,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-12-07 18:25:58,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-07 18:25:58,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 147 transitions. [2019-12-07 18:25:58,938 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 147 transitions. Word has length 19 [2019-12-07 18:25:58,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:58,938 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 147 transitions. [2019-12-07 18:25:58,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:25:58,938 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 147 transitions. [2019-12-07 18:25:58,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:25:58,939 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:58,939 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:58,939 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:58,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:58,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1698806816, now seen corresponding path program 1 times [2019-12-07 18:25:58,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:58,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690716844] [2019-12-07 18:25:58,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:58,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:58,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690716844] [2019-12-07 18:25:58,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:58,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:25:58,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151203486] [2019-12-07 18:25:58,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:25:58,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:58,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:25:58,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:25:58,964 INFO L87 Difference]: Start difference. First operand 81 states and 147 transitions. Second operand 3 states. [2019-12-07 18:25:58,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:58,976 INFO L93 Difference]: Finished difference Result 156 states and 284 transitions. [2019-12-07 18:25:58,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:58,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 18:25:58,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:58,977 INFO L225 Difference]: With dead ends: 156 [2019-12-07 18:25:58,977 INFO L226 Difference]: Without dead ends: 154 [2019-12-07 18:25:58,978 INFO L630 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 [2019-12-07 18:25:58,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-12-07 18:25:58,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 108. [2019-12-07 18:25:58,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-12-07 18:25:58,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 196 transitions. [2019-12-07 18:25:58,985 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 196 transitions. Word has length 19 [2019-12-07 18:25:58,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:58,985 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 196 transitions. [2019-12-07 18:25:58,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:25:58,985 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 196 transitions. [2019-12-07 18:25:58,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:25:58,986 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:58,986 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:58,986 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:58,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:58,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1316296802, now seen corresponding path program 1 times [2019-12-07 18:25:58,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:58,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345882046] [2019-12-07 18:25:58,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:59,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:59,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345882046] [2019-12-07 18:25:59,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:59,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:25:59,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723046729] [2019-12-07 18:25:59,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:25:59,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:59,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:25:59,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:25:59,008 INFO L87 Difference]: Start difference. First operand 108 states and 196 transitions. Second operand 3 states. [2019-12-07 18:25:59,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:59,018 INFO L93 Difference]: Finished difference Result 260 states and 474 transitions. [2019-12-07 18:25:59,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:59,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 18:25:59,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:59,020 INFO L225 Difference]: With dead ends: 260 [2019-12-07 18:25:59,020 INFO L226 Difference]: Without dead ends: 156 [2019-12-07 18:25:59,021 INFO L630 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 [2019-12-07 18:25:59,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-12-07 18:25:59,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2019-12-07 18:25:59,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 18:25:59,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 278 transitions. [2019-12-07 18:25:59,028 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 278 transitions. Word has length 19 [2019-12-07 18:25:59,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:59,028 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 278 transitions. [2019-12-07 18:25:59,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:25:59,028 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 278 transitions. [2019-12-07 18:25:59,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:25:59,029 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:59,029 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:59,029 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:59,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:59,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1123190704, now seen corresponding path program 1 times [2019-12-07 18:25:59,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:59,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19692609] [2019-12-07 18:25:59,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:59,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:59,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19692609] [2019-12-07 18:25:59,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:59,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:25:59,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127821586] [2019-12-07 18:25:59,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:25:59,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:59,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:25:59,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:25:59,050 INFO L87 Difference]: Start difference. First operand 154 states and 278 transitions. Second operand 3 states. [2019-12-07 18:25:59,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:59,060 INFO L93 Difference]: Finished difference Result 233 states and 417 transitions. [2019-12-07 18:25:59,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:59,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 18:25:59,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:59,061 INFO L225 Difference]: With dead ends: 233 [2019-12-07 18:25:59,061 INFO L226 Difference]: Without dead ends: 158 [2019-12-07 18:25:59,062 INFO L630 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 [2019-12-07 18:25:59,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-12-07 18:25:59,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2019-12-07 18:25:59,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-12-07 18:25:59,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 278 transitions. [2019-12-07 18:25:59,068 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 278 transitions. Word has length 20 [2019-12-07 18:25:59,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:59,068 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 278 transitions. [2019-12-07 18:25:59,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:25:59,068 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 278 transitions. [2019-12-07 18:25:59,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:25:59,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:59,069 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:59,069 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:59,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:59,070 INFO L82 PathProgramCache]: Analyzing trace with hash -2144259058, now seen corresponding path program 1 times [2019-12-07 18:25:59,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:59,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080291818] [2019-12-07 18:25:59,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:59,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:59,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080291818] [2019-12-07 18:25:59,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:59,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:25:59,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579047734] [2019-12-07 18:25:59,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:25:59,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:59,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:25:59,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:25:59,088 INFO L87 Difference]: Start difference. First operand 156 states and 278 transitions. Second operand 3 states. [2019-12-07 18:25:59,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:59,101 INFO L93 Difference]: Finished difference Result 452 states and 808 transitions. [2019-12-07 18:25:59,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:59,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 18:25:59,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:59,103 INFO L225 Difference]: With dead ends: 452 [2019-12-07 18:25:59,103 INFO L226 Difference]: Without dead ends: 302 [2019-12-07 18:25:59,104 INFO L630 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 [2019-12-07 18:25:59,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-12-07 18:25:59,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2019-12-07 18:25:59,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-12-07 18:25:59,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 530 transitions. [2019-12-07 18:25:59,112 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 530 transitions. Word has length 20 [2019-12-07 18:25:59,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:59,113 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 530 transitions. [2019-12-07 18:25:59,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:25:59,113 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 530 transitions. [2019-12-07 18:25:59,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:25:59,114 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:59,114 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:59,114 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:59,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:59,114 INFO L82 PathProgramCache]: Analyzing trace with hash -864395380, now seen corresponding path program 1 times [2019-12-07 18:25:59,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:59,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994566784] [2019-12-07 18:25:59,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:59,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:59,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994566784] [2019-12-07 18:25:59,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:59,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:25:59,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360065378] [2019-12-07 18:25:59,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:25:59,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:59,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:25:59,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:25:59,131 INFO L87 Difference]: Start difference. First operand 300 states and 530 transitions. Second operand 3 states. [2019-12-07 18:25:59,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:59,144 INFO L93 Difference]: Finished difference Result 384 states and 684 transitions. [2019-12-07 18:25:59,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:59,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 18:25:59,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:59,147 INFO L225 Difference]: With dead ends: 384 [2019-12-07 18:25:59,148 INFO L226 Difference]: Without dead ends: 382 [2019-12-07 18:25:59,148 INFO L630 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 [2019-12-07 18:25:59,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-12-07 18:25:59,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 300. [2019-12-07 18:25:59,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-12-07 18:25:59,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 526 transitions. [2019-12-07 18:25:59,158 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 526 transitions. Word has length 20 [2019-12-07 18:25:59,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:59,159 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 526 transitions. [2019-12-07 18:25:59,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:25:59,159 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 526 transitions. [2019-12-07 18:25:59,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:25:59,160 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:59,160 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:59,161 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:59,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:59,161 INFO L82 PathProgramCache]: Analyzing trace with hash -2047307977, now seen corresponding path program 1 times [2019-12-07 18:25:59,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:59,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394656587] [2019-12-07 18:25:59,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:59,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394656587] [2019-12-07 18:25:59,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:59,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:25:59,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474786075] [2019-12-07 18:25:59,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:25:59,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:59,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:25:59,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:25:59,181 INFO L87 Difference]: Start difference. First operand 300 states and 526 transitions. Second operand 3 states. [2019-12-07 18:25:59,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:59,193 INFO L93 Difference]: Finished difference Result 564 states and 1000 transitions. [2019-12-07 18:25:59,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:59,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 18:25:59,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:59,196 INFO L225 Difference]: With dead ends: 564 [2019-12-07 18:25:59,196 INFO L226 Difference]: Without dead ends: 562 [2019-12-07 18:25:59,197 INFO L630 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 [2019-12-07 18:25:59,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-12-07 18:25:59,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 416. [2019-12-07 18:25:59,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-12-07 18:25:59,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 718 transitions. [2019-12-07 18:25:59,206 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 718 transitions. Word has length 21 [2019-12-07 18:25:59,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:59,207 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 718 transitions. [2019-12-07 18:25:59,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:25:59,207 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 718 transitions. [2019-12-07 18:25:59,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:25:59,207 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:59,208 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:59,208 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:59,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:59,208 INFO L82 PathProgramCache]: Analyzing trace with hash 967795641, now seen corresponding path program 1 times [2019-12-07 18:25:59,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:59,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421318709] [2019-12-07 18:25:59,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:59,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:59,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421318709] [2019-12-07 18:25:59,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:59,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:25:59,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894331897] [2019-12-07 18:25:59,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:25:59,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:59,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:25:59,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:25:59,222 INFO L87 Difference]: Start difference. First operand 416 states and 718 transitions. Second operand 3 states. [2019-12-07 18:25:59,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:59,237 INFO L93 Difference]: Finished difference Result 996 states and 1728 transitions. [2019-12-07 18:25:59,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:59,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 18:25:59,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:59,239 INFO L225 Difference]: With dead ends: 996 [2019-12-07 18:25:59,240 INFO L226 Difference]: Without dead ends: 586 [2019-12-07 18:25:59,240 INFO L630 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 [2019-12-07 18:25:59,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-12-07 18:25:59,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2019-12-07 18:25:59,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-12-07 18:25:59,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1002 transitions. [2019-12-07 18:25:59,253 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1002 transitions. Word has length 21 [2019-12-07 18:25:59,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:59,253 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 1002 transitions. [2019-12-07 18:25:59,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:25:59,253 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1002 transitions. [2019-12-07 18:25:59,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:25:59,254 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:59,254 INFO L410 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] [2019-12-07 18:25:59,254 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:59,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:59,254 INFO L82 PathProgramCache]: Analyzing trace with hash 958175875, now seen corresponding path program 1 times [2019-12-07 18:25:59,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:59,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280026439] [2019-12-07 18:25:59,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:59,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:59,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280026439] [2019-12-07 18:25:59,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:59,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:25:59,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879552254] [2019-12-07 18:25:59,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:25:59,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:59,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:25:59,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:25:59,269 INFO L87 Difference]: Start difference. First operand 584 states and 1002 transitions. Second operand 3 states. [2019-12-07 18:25:59,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:59,283 INFO L93 Difference]: Finished difference Result 884 states and 1512 transitions. [2019-12-07 18:25:59,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:59,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 18:25:59,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:59,286 INFO L225 Difference]: With dead ends: 884 [2019-12-07 18:25:59,287 INFO L226 Difference]: Without dead ends: 598 [2019-12-07 18:25:59,287 INFO L630 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 [2019-12-07 18:25:59,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-12-07 18:25:59,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2019-12-07 18:25:59,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-12-07 18:25:59,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1010 transitions. [2019-12-07 18:25:59,298 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1010 transitions. Word has length 22 [2019-12-07 18:25:59,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:59,298 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1010 transitions. [2019-12-07 18:25:59,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:25:59,299 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1010 transitions. [2019-12-07 18:25:59,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:25:59,299 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:59,299 INFO L410 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] [2019-12-07 18:25:59,299 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:59,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:59,300 INFO L82 PathProgramCache]: Analyzing trace with hash -62892479, now seen corresponding path program 1 times [2019-12-07 18:25:59,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:59,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145068824] [2019-12-07 18:25:59,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:59,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:59,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145068824] [2019-12-07 18:25:59,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:59,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:25:59,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722850767] [2019-12-07 18:25:59,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:25:59,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:59,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:25:59,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:25:59,314 INFO L87 Difference]: Start difference. First operand 596 states and 1010 transitions. Second operand 3 states. [2019-12-07 18:25:59,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:59,328 INFO L93 Difference]: Finished difference Result 1096 states and 1884 transitions. [2019-12-07 18:25:59,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:59,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 18:25:59,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:59,333 INFO L225 Difference]: With dead ends: 1096 [2019-12-07 18:25:59,333 INFO L226 Difference]: Without dead ends: 1094 [2019-12-07 18:25:59,333 INFO L630 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 [2019-12-07 18:25:59,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2019-12-07 18:25:59,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 836. [2019-12-07 18:25:59,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-12-07 18:25:59,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1386 transitions. [2019-12-07 18:25:59,349 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1386 transitions. Word has length 22 [2019-12-07 18:25:59,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:59,349 INFO L462 AbstractCegarLoop]: Abstraction has 836 states and 1386 transitions. [2019-12-07 18:25:59,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:25:59,349 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1386 transitions. [2019-12-07 18:25:59,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:25:59,350 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:59,350 INFO L410 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] [2019-12-07 18:25:59,351 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:59,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:59,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1342756157, now seen corresponding path program 1 times [2019-12-07 18:25:59,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:59,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346783858] [2019-12-07 18:25:59,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:59,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346783858] [2019-12-07 18:25:59,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:59,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:25:59,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784859590] [2019-12-07 18:25:59,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:25:59,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:59,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:25:59,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:25:59,366 INFO L87 Difference]: Start difference. First operand 836 states and 1386 transitions. Second operand 3 states. [2019-12-07 18:25:59,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:59,386 INFO L93 Difference]: Finished difference Result 1976 states and 3292 transitions. [2019-12-07 18:25:59,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:59,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 18:25:59,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:59,391 INFO L225 Difference]: With dead ends: 1976 [2019-12-07 18:25:59,391 INFO L226 Difference]: Without dead ends: 1158 [2019-12-07 18:25:59,392 INFO L630 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 [2019-12-07 18:25:59,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-12-07 18:25:59,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1156. [2019-12-07 18:25:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2019-12-07 18:25:59,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1906 transitions. [2019-12-07 18:25:59,417 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1906 transitions. Word has length 22 [2019-12-07 18:25:59,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:59,417 INFO L462 AbstractCegarLoop]: Abstraction has 1156 states and 1906 transitions. [2019-12-07 18:25:59,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:25:59,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1906 transitions. [2019-12-07 18:25:59,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 18:25:59,418 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:59,418 INFO L410 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] [2019-12-07 18:25:59,419 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:59,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:59,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1949452786, now seen corresponding path program 1 times [2019-12-07 18:25:59,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:59,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12183680] [2019-12-07 18:25:59,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:59,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:59,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12183680] [2019-12-07 18:25:59,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:59,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:25:59,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989828143] [2019-12-07 18:25:59,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:25:59,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:59,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:25:59,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:25:59,434 INFO L87 Difference]: Start difference. First operand 1156 states and 1906 transitions. Second operand 3 states. [2019-12-07 18:25:59,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:59,452 INFO L93 Difference]: Finished difference Result 1736 states and 2852 transitions. [2019-12-07 18:25:59,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:59,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 18:25:59,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:59,457 INFO L225 Difference]: With dead ends: 1736 [2019-12-07 18:25:59,457 INFO L226 Difference]: Without dead ends: 1174 [2019-12-07 18:25:59,458 INFO L630 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 [2019-12-07 18:25:59,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2019-12-07 18:25:59,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1172. [2019-12-07 18:25:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2019-12-07 18:25:59,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1906 transitions. [2019-12-07 18:25:59,483 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1906 transitions. Word has length 23 [2019-12-07 18:25:59,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:59,483 INFO L462 AbstractCegarLoop]: Abstraction has 1172 states and 1906 transitions. [2019-12-07 18:25:59,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:25:59,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1906 transitions. [2019-12-07 18:25:59,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 18:25:59,485 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:59,485 INFO L410 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] [2019-12-07 18:25:59,485 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:59,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:59,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1324446156, now seen corresponding path program 1 times [2019-12-07 18:25:59,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:59,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374020206] [2019-12-07 18:25:59,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:59,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:59,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374020206] [2019-12-07 18:25:59,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:59,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:25:59,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566325236] [2019-12-07 18:25:59,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:25:59,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:59,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:25:59,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:25:59,500 INFO L87 Difference]: Start difference. First operand 1172 states and 1906 transitions. Second operand 3 states. [2019-12-07 18:25:59,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:59,533 INFO L93 Difference]: Finished difference Result 2120 states and 3508 transitions. [2019-12-07 18:25:59,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:59,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 18:25:59,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:59,544 INFO L225 Difference]: With dead ends: 2120 [2019-12-07 18:25:59,545 INFO L226 Difference]: Without dead ends: 2118 [2019-12-07 18:25:59,546 INFO L630 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 [2019-12-07 18:25:59,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2019-12-07 18:25:59,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 1668. [2019-12-07 18:25:59,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2019-12-07 18:25:59,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 2642 transitions. [2019-12-07 18:25:59,589 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 2642 transitions. Word has length 23 [2019-12-07 18:25:59,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:59,590 INFO L462 AbstractCegarLoop]: Abstraction has 1668 states and 2642 transitions. [2019-12-07 18:25:59,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:25:59,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2642 transitions. [2019-12-07 18:25:59,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 18:25:59,592 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:59,592 INFO L410 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] [2019-12-07 18:25:59,592 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:59,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:59,592 INFO L82 PathProgramCache]: Analyzing trace with hash 44582478, now seen corresponding path program 1 times [2019-12-07 18:25:59,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:59,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004890832] [2019-12-07 18:25:59,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:59,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:59,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004890832] [2019-12-07 18:25:59,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:59,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:25:59,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963685502] [2019-12-07 18:25:59,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:25:59,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:59,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:25:59,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:25:59,608 INFO L87 Difference]: Start difference. First operand 1668 states and 2642 transitions. Second operand 3 states. [2019-12-07 18:25:59,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:59,653 INFO L93 Difference]: Finished difference Result 3912 states and 6228 transitions. [2019-12-07 18:25:59,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:59,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 18:25:59,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:59,665 INFO L225 Difference]: With dead ends: 3912 [2019-12-07 18:25:59,665 INFO L226 Difference]: Without dead ends: 2278 [2019-12-07 18:25:59,668 INFO L630 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 [2019-12-07 18:25:59,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2019-12-07 18:25:59,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2276. [2019-12-07 18:25:59,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2276 states. [2019-12-07 18:25:59,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 2276 states and 3586 transitions. [2019-12-07 18:25:59,712 INFO L78 Accepts]: Start accepts. Automaton has 2276 states and 3586 transitions. Word has length 23 [2019-12-07 18:25:59,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:59,712 INFO L462 AbstractCegarLoop]: Abstraction has 2276 states and 3586 transitions. [2019-12-07 18:25:59,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:25:59,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 3586 transitions. [2019-12-07 18:25:59,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 18:25:59,714 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:59,714 INFO L410 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] [2019-12-07 18:25:59,714 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:59,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:59,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1891627720, now seen corresponding path program 1 times [2019-12-07 18:25:59,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:59,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763249919] [2019-12-07 18:25:59,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:59,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:59,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763249919] [2019-12-07 18:25:59,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:59,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:25:59,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314941812] [2019-12-07 18:25:59,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:25:59,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:59,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:25:59,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:25:59,728 INFO L87 Difference]: Start difference. First operand 2276 states and 3586 transitions. Second operand 3 states. [2019-12-07 18:25:59,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:59,754 INFO L93 Difference]: Finished difference Result 3416 states and 5364 transitions. [2019-12-07 18:25:59,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:59,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 18:25:59,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:59,763 INFO L225 Difference]: With dead ends: 3416 [2019-12-07 18:25:59,763 INFO L226 Difference]: Without dead ends: 2310 [2019-12-07 18:25:59,764 INFO L630 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 [2019-12-07 18:25:59,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2019-12-07 18:25:59,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 2308. [2019-12-07 18:25:59,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2308 states. [2019-12-07 18:25:59,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 3586 transitions. [2019-12-07 18:25:59,804 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 3586 transitions. Word has length 24 [2019-12-07 18:25:59,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:59,804 INFO L462 AbstractCegarLoop]: Abstraction has 2308 states and 3586 transitions. [2019-12-07 18:25:59,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:25:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 3586 transitions. [2019-12-07 18:25:59,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 18:25:59,806 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:59,806 INFO L410 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] [2019-12-07 18:25:59,806 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:59,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:59,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1382271222, now seen corresponding path program 1 times [2019-12-07 18:25:59,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:59,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478814521] [2019-12-07 18:25:59,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:59,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:59,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478814521] [2019-12-07 18:25:59,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:59,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:25:59,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43971785] [2019-12-07 18:25:59,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:25:59,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:59,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:25:59,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:25:59,818 INFO L87 Difference]: Start difference. First operand 2308 states and 3586 transitions. Second operand 3 states. [2019-12-07 18:25:59,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:59,853 INFO L93 Difference]: Finished difference Result 4104 states and 6500 transitions. [2019-12-07 18:25:59,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:59,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 18:25:59,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:59,868 INFO L225 Difference]: With dead ends: 4104 [2019-12-07 18:25:59,868 INFO L226 Difference]: Without dead ends: 4102 [2019-12-07 18:25:59,869 INFO L630 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 [2019-12-07 18:25:59,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2019-12-07 18:25:59,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 3332. [2019-12-07 18:25:59,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3332 states. [2019-12-07 18:25:59,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 5026 transitions. [2019-12-07 18:25:59,928 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 5026 transitions. Word has length 24 [2019-12-07 18:25:59,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:59,928 INFO L462 AbstractCegarLoop]: Abstraction has 3332 states and 5026 transitions. [2019-12-07 18:25:59,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:25:59,928 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 5026 transitions. [2019-12-07 18:25:59,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 18:25:59,931 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:59,931 INFO L410 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] [2019-12-07 18:25:59,932 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:59,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:59,932 INFO L82 PathProgramCache]: Analyzing trace with hash 102407544, now seen corresponding path program 1 times [2019-12-07 18:25:59,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:59,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795762016] [2019-12-07 18:25:59,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:59,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:25:59,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795762016] [2019-12-07 18:25:59,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:59,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:25:59,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528847065] [2019-12-07 18:25:59,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:25:59,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:59,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:25:59,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:25:59,944 INFO L87 Difference]: Start difference. First operand 3332 states and 5026 transitions. Second operand 3 states. [2019-12-07 18:25:59,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:59,993 INFO L93 Difference]: Finished difference Result 7752 states and 11748 transitions. [2019-12-07 18:25:59,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:59,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 18:25:59,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:00,009 INFO L225 Difference]: With dead ends: 7752 [2019-12-07 18:26:00,009 INFO L226 Difference]: Without dead ends: 4486 [2019-12-07 18:26:00,012 INFO L630 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 [2019-12-07 18:26:00,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-12-07 18:26:00,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 4484. [2019-12-07 18:26:00,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4484 states. [2019-12-07 18:26:00,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4484 states to 4484 states and 6722 transitions. [2019-12-07 18:26:00,096 INFO L78 Accepts]: Start accepts. Automaton has 4484 states and 6722 transitions. Word has length 24 [2019-12-07 18:26:00,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:00,096 INFO L462 AbstractCegarLoop]: Abstraction has 4484 states and 6722 transitions. [2019-12-07 18:26:00,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:26:00,096 INFO L276 IsEmpty]: Start isEmpty. Operand 4484 states and 6722 transitions. [2019-12-07 18:26:00,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 18:26:00,099 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:00,099 INFO L410 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] [2019-12-07 18:26:00,099 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:00,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:00,099 INFO L82 PathProgramCache]: Analyzing trace with hash -99050333, now seen corresponding path program 1 times [2019-12-07 18:26:00,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:00,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492962831] [2019-12-07 18:26:00,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:00,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:00,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492962831] [2019-12-07 18:26:00,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:00,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:26:00,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164153253] [2019-12-07 18:26:00,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:26:00,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:00,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:26:00,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:26:00,111 INFO L87 Difference]: Start difference. First operand 4484 states and 6722 transitions. Second operand 3 states. [2019-12-07 18:26:00,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:00,157 INFO L93 Difference]: Finished difference Result 6728 states and 10052 transitions. [2019-12-07 18:26:00,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:26:00,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 18:26:00,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:00,174 INFO L225 Difference]: With dead ends: 6728 [2019-12-07 18:26:00,174 INFO L226 Difference]: Without dead ends: 4550 [2019-12-07 18:26:00,177 INFO L630 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 [2019-12-07 18:26:00,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4550 states. [2019-12-07 18:26:00,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4550 to 4548. [2019-12-07 18:26:00,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4548 states. [2019-12-07 18:26:00,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4548 states to 4548 states and 6722 transitions. [2019-12-07 18:26:00,251 INFO L78 Accepts]: Start accepts. Automaton has 4548 states and 6722 transitions. Word has length 25 [2019-12-07 18:26:00,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:00,252 INFO L462 AbstractCegarLoop]: Abstraction has 4548 states and 6722 transitions. [2019-12-07 18:26:00,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:26:00,252 INFO L276 IsEmpty]: Start isEmpty. Operand 4548 states and 6722 transitions. [2019-12-07 18:26:00,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 18:26:00,266 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:00,266 INFO L410 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] [2019-12-07 18:26:00,266 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:00,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:00,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1120118687, now seen corresponding path program 1 times [2019-12-07 18:26:00,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:00,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402149474] [2019-12-07 18:26:00,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:00,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:00,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402149474] [2019-12-07 18:26:00,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:00,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:26:00,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417474374] [2019-12-07 18:26:00,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:26:00,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:00,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:26:00,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:26:00,279 INFO L87 Difference]: Start difference. First operand 4548 states and 6722 transitions. Second operand 3 states. [2019-12-07 18:26:00,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:00,331 INFO L93 Difference]: Finished difference Result 7944 states and 11972 transitions. [2019-12-07 18:26:00,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:26:00,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 18:26:00,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:00,342 INFO L225 Difference]: With dead ends: 7944 [2019-12-07 18:26:00,342 INFO L226 Difference]: Without dead ends: 7942 [2019-12-07 18:26:00,344 INFO L630 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 [2019-12-07 18:26:00,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7942 states. [2019-12-07 18:26:00,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7942 to 6660. [2019-12-07 18:26:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6660 states. [2019-12-07 18:26:00,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6660 states to 6660 states and 9538 transitions. [2019-12-07 18:26:00,446 INFO L78 Accepts]: Start accepts. Automaton has 6660 states and 9538 transitions. Word has length 25 [2019-12-07 18:26:00,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:00,446 INFO L462 AbstractCegarLoop]: Abstraction has 6660 states and 9538 transitions. [2019-12-07 18:26:00,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:26:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 6660 states and 9538 transitions. [2019-12-07 18:26:00,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 18:26:00,452 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:00,452 INFO L410 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] [2019-12-07 18:26:00,452 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:00,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:00,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1894984931, now seen corresponding path program 1 times [2019-12-07 18:26:00,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:00,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140487238] [2019-12-07 18:26:00,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:00,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140487238] [2019-12-07 18:26:00,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:00,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:26:00,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288266833] [2019-12-07 18:26:00,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:26:00,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:00,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:26:00,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:26:00,464 INFO L87 Difference]: Start difference. First operand 6660 states and 9538 transitions. Second operand 3 states. [2019-12-07 18:26:00,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:00,534 INFO L93 Difference]: Finished difference Result 15368 states and 22084 transitions. [2019-12-07 18:26:00,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:26:00,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 18:26:00,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:00,545 INFO L225 Difference]: With dead ends: 15368 [2019-12-07 18:26:00,545 INFO L226 Difference]: Without dead ends: 8838 [2019-12-07 18:26:00,551 INFO L630 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 [2019-12-07 18:26:00,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8838 states. [2019-12-07 18:26:00,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8838 to 8836. [2019-12-07 18:26:00,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8836 states. [2019-12-07 18:26:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8836 states to 8836 states and 12546 transitions. [2019-12-07 18:26:00,686 INFO L78 Accepts]: Start accepts. Automaton has 8836 states and 12546 transitions. Word has length 25 [2019-12-07 18:26:00,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:00,686 INFO L462 AbstractCegarLoop]: Abstraction has 8836 states and 12546 transitions. [2019-12-07 18:26:00,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:26:00,686 INFO L276 IsEmpty]: Start isEmpty. Operand 8836 states and 12546 transitions. [2019-12-07 18:26:00,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 18:26:00,692 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:00,692 INFO L410 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] [2019-12-07 18:26:00,693 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:00,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:00,693 INFO L82 PathProgramCache]: Analyzing trace with hash -363725843, now seen corresponding path program 1 times [2019-12-07 18:26:00,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:00,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206315301] [2019-12-07 18:26:00,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:00,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:00,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206315301] [2019-12-07 18:26:00,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:00,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:26:00,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625850476] [2019-12-07 18:26:00,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:26:00,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:00,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:26:00,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:26:00,705 INFO L87 Difference]: Start difference. First operand 8836 states and 12546 transitions. Second operand 3 states. [2019-12-07 18:26:00,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:00,771 INFO L93 Difference]: Finished difference Result 13256 states and 18756 transitions. [2019-12-07 18:26:00,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:26:00,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 18:26:00,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:00,781 INFO L225 Difference]: With dead ends: 13256 [2019-12-07 18:26:00,781 INFO L226 Difference]: Without dead ends: 8966 [2019-12-07 18:26:00,786 INFO L630 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 [2019-12-07 18:26:00,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8966 states. [2019-12-07 18:26:00,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8966 to 8964. [2019-12-07 18:26:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8964 states. [2019-12-07 18:26:00,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8964 states to 8964 states and 12546 transitions. [2019-12-07 18:26:00,946 INFO L78 Accepts]: Start accepts. Automaton has 8964 states and 12546 transitions. Word has length 26 [2019-12-07 18:26:00,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:00,947 INFO L462 AbstractCegarLoop]: Abstraction has 8964 states and 12546 transitions. [2019-12-07 18:26:00,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:26:00,947 INFO L276 IsEmpty]: Start isEmpty. Operand 8964 states and 12546 transitions. [2019-12-07 18:26:00,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 18:26:00,953 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:00,953 INFO L410 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] [2019-12-07 18:26:00,953 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:00,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:00,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1384794197, now seen corresponding path program 1 times [2019-12-07 18:26:00,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:00,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267906485] [2019-12-07 18:26:00,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:00,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:00,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267906485] [2019-12-07 18:26:00,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:00,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:26:00,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254483291] [2019-12-07 18:26:00,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:26:00,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:00,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:26:00,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:26:00,966 INFO L87 Difference]: Start difference. First operand 8964 states and 12546 transitions. Second operand 3 states. [2019-12-07 18:26:01,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:01,075 INFO L93 Difference]: Finished difference Result 15368 states and 21892 transitions. [2019-12-07 18:26:01,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:26:01,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 18:26:01,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:01,092 INFO L225 Difference]: With dead ends: 15368 [2019-12-07 18:26:01,092 INFO L226 Difference]: Without dead ends: 15366 [2019-12-07 18:26:01,095 INFO L630 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 [2019-12-07 18:26:01,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15366 states. [2019-12-07 18:26:01,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15366 to 13316. [2019-12-07 18:26:01,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13316 states. [2019-12-07 18:26:01,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13316 states to 13316 states and 18050 transitions. [2019-12-07 18:26:01,254 INFO L78 Accepts]: Start accepts. Automaton has 13316 states and 18050 transitions. Word has length 26 [2019-12-07 18:26:01,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:01,255 INFO L462 AbstractCegarLoop]: Abstraction has 13316 states and 18050 transitions. [2019-12-07 18:26:01,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:26:01,255 INFO L276 IsEmpty]: Start isEmpty. Operand 13316 states and 18050 transitions. [2019-12-07 18:26:01,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 18:26:01,266 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:01,266 INFO L410 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] [2019-12-07 18:26:01,266 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:01,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:01,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1630309421, now seen corresponding path program 1 times [2019-12-07 18:26:01,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:01,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038716807] [2019-12-07 18:26:01,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:01,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:01,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038716807] [2019-12-07 18:26:01,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:01,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:26:01,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638809559] [2019-12-07 18:26:01,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:26:01,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:01,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:26:01,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:26:01,278 INFO L87 Difference]: Start difference. First operand 13316 states and 18050 transitions. Second operand 3 states. [2019-12-07 18:26:01,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:01,407 INFO L93 Difference]: Finished difference Result 30472 states and 41348 transitions. [2019-12-07 18:26:01,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:26:01,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 18:26:01,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:01,433 INFO L225 Difference]: With dead ends: 30472 [2019-12-07 18:26:01,433 INFO L226 Difference]: Without dead ends: 17414 [2019-12-07 18:26:01,475 INFO L630 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 [2019-12-07 18:26:01,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17414 states. [2019-12-07 18:26:01,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17414 to 17412. [2019-12-07 18:26:01,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17412 states. [2019-12-07 18:26:01,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17412 states to 17412 states and 23298 transitions. [2019-12-07 18:26:01,657 INFO L78 Accepts]: Start accepts. Automaton has 17412 states and 23298 transitions. Word has length 26 [2019-12-07 18:26:01,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:01,657 INFO L462 AbstractCegarLoop]: Abstraction has 17412 states and 23298 transitions. [2019-12-07 18:26:01,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:26:01,658 INFO L276 IsEmpty]: Start isEmpty. Operand 17412 states and 23298 transitions. [2019-12-07 18:26:01,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:26:01,667 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:01,667 INFO L410 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] [2019-12-07 18:26:01,667 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:01,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:01,668 INFO L82 PathProgramCache]: Analyzing trace with hash 21268280, now seen corresponding path program 1 times [2019-12-07 18:26:01,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:01,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789574835] [2019-12-07 18:26:01,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:01,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:01,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789574835] [2019-12-07 18:26:01,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:01,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:26:01,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427636616] [2019-12-07 18:26:01,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:26:01,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:01,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:26:01,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:26:01,680 INFO L87 Difference]: Start difference. First operand 17412 states and 23298 transitions. Second operand 3 states. [2019-12-07 18:26:01,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:01,776 INFO L93 Difference]: Finished difference Result 26120 states and 34820 transitions. [2019-12-07 18:26:01,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:26:01,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 18:26:01,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:01,795 INFO L225 Difference]: With dead ends: 26120 [2019-12-07 18:26:01,795 INFO L226 Difference]: Without dead ends: 17670 [2019-12-07 18:26:01,802 INFO L630 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 [2019-12-07 18:26:01,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17670 states. [2019-12-07 18:26:01,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17670 to 17668. [2019-12-07 18:26:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17668 states. [2019-12-07 18:26:01,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17668 states to 17668 states and 23298 transitions. [2019-12-07 18:26:01,997 INFO L78 Accepts]: Start accepts. Automaton has 17668 states and 23298 transitions. Word has length 27 [2019-12-07 18:26:01,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:01,997 INFO L462 AbstractCegarLoop]: Abstraction has 17668 states and 23298 transitions. [2019-12-07 18:26:01,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:26:01,997 INFO L276 IsEmpty]: Start isEmpty. Operand 17668 states and 23298 transitions. [2019-12-07 18:26:02,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:26:02,008 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:02,008 INFO L410 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] [2019-12-07 18:26:02,008 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:02,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:02,008 INFO L82 PathProgramCache]: Analyzing trace with hash -999800074, now seen corresponding path program 1 times [2019-12-07 18:26:02,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:02,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144515578] [2019-12-07 18:26:02,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:02,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:02,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144515578] [2019-12-07 18:26:02,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:02,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:26:02,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637081656] [2019-12-07 18:26:02,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:26:02,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:02,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:26:02,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:26:02,021 INFO L87 Difference]: Start difference. First operand 17668 states and 23298 transitions. Second operand 3 states. [2019-12-07 18:26:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:02,179 INFO L93 Difference]: Finished difference Result 29704 states and 39684 transitions. [2019-12-07 18:26:02,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:26:02,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 18:26:02,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:02,206 INFO L225 Difference]: With dead ends: 29704 [2019-12-07 18:26:02,207 INFO L226 Difference]: Without dead ends: 29702 [2019-12-07 18:26:02,211 INFO L630 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 [2019-12-07 18:26:02,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29702 states. [2019-12-07 18:26:02,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29702 to 26628. [2019-12-07 18:26:02,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26628 states. [2019-12-07 18:26:02,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26628 states to 26628 states and 34050 transitions. [2019-12-07 18:26:02,474 INFO L78 Accepts]: Start accepts. Automaton has 26628 states and 34050 transitions. Word has length 27 [2019-12-07 18:26:02,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:02,474 INFO L462 AbstractCegarLoop]: Abstraction has 26628 states and 34050 transitions. [2019-12-07 18:26:02,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:26:02,474 INFO L276 IsEmpty]: Start isEmpty. Operand 26628 states and 34050 transitions. [2019-12-07 18:26:02,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:26:02,490 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:02,490 INFO L410 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] [2019-12-07 18:26:02,490 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:02,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:02,490 INFO L82 PathProgramCache]: Analyzing trace with hash 2015303544, now seen corresponding path program 1 times [2019-12-07 18:26:02,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:02,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185953156] [2019-12-07 18:26:02,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:02,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:02,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185953156] [2019-12-07 18:26:02,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:02,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:26:02,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400622994] [2019-12-07 18:26:02,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:26:02,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:02,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:26:02,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:26:02,502 INFO L87 Difference]: Start difference. First operand 26628 states and 34050 transitions. Second operand 3 states. [2019-12-07 18:26:02,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:02,780 INFO L93 Difference]: Finished difference Result 60424 states and 77060 transitions. [2019-12-07 18:26:02,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:26:02,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 18:26:02,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:02,801 INFO L225 Difference]: With dead ends: 60424 [2019-12-07 18:26:02,802 INFO L226 Difference]: Without dead ends: 34310 [2019-12-07 18:26:02,818 INFO L630 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 [2019-12-07 18:26:02,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34310 states. [2019-12-07 18:26:03,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34310 to 34308. [2019-12-07 18:26:03,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34308 states. [2019-12-07 18:26:03,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34308 states to 34308 states and 43010 transitions. [2019-12-07 18:26:03,142 INFO L78 Accepts]: Start accepts. Automaton has 34308 states and 43010 transitions. Word has length 27 [2019-12-07 18:26:03,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:03,143 INFO L462 AbstractCegarLoop]: Abstraction has 34308 states and 43010 transitions. [2019-12-07 18:26:03,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:26:03,143 INFO L276 IsEmpty]: Start isEmpty. Operand 34308 states and 43010 transitions. [2019-12-07 18:26:03,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:26:03,154 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:03,154 INFO L410 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] [2019-12-07 18:26:03,154 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:03,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:03,154 INFO L82 PathProgramCache]: Analyzing trace with hash -928815454, now seen corresponding path program 1 times [2019-12-07 18:26:03,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:03,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394097102] [2019-12-07 18:26:03,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:03,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:03,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394097102] [2019-12-07 18:26:03,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:03,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:26:03,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976103739] [2019-12-07 18:26:03,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:26:03,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:03,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:26:03,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:26:03,168 INFO L87 Difference]: Start difference. First operand 34308 states and 43010 transitions. Second operand 3 states. [2019-12-07 18:26:03,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:03,373 INFO L93 Difference]: Finished difference Result 51464 states and 64260 transitions. [2019-12-07 18:26:03,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:26:03,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 18:26:03,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:03,403 INFO L225 Difference]: With dead ends: 51464 [2019-12-07 18:26:03,404 INFO L226 Difference]: Without dead ends: 34822 [2019-12-07 18:26:03,416 INFO L630 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 [2019-12-07 18:26:03,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34822 states. [2019-12-07 18:26:03,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34822 to 34820. [2019-12-07 18:26:03,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34820 states. [2019-12-07 18:26:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34820 states to 34820 states and 43010 transitions. [2019-12-07 18:26:03,812 INFO L78 Accepts]: Start accepts. Automaton has 34820 states and 43010 transitions. Word has length 28 [2019-12-07 18:26:03,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:03,812 INFO L462 AbstractCegarLoop]: Abstraction has 34820 states and 43010 transitions. [2019-12-07 18:26:03,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:26:03,812 INFO L276 IsEmpty]: Start isEmpty. Operand 34820 states and 43010 transitions. [2019-12-07 18:26:03,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:26:03,821 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:03,822 INFO L410 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] [2019-12-07 18:26:03,822 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:03,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:03,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1949883808, now seen corresponding path program 1 times [2019-12-07 18:26:03,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:03,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272349904] [2019-12-07 18:26:03,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:03,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:03,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272349904] [2019-12-07 18:26:03,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:03,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:26:03,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515239532] [2019-12-07 18:26:03,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:26:03,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:03,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:26:03,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:26:03,834 INFO L87 Difference]: Start difference. First operand 34820 states and 43010 transitions. Second operand 3 states. [2019-12-07 18:26:04,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:04,197 INFO L93 Difference]: Finished difference Result 101384 states and 122884 transitions. [2019-12-07 18:26:04,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:26:04,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 18:26:04,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:04,246 INFO L225 Difference]: With dead ends: 101384 [2019-12-07 18:26:04,246 INFO L226 Difference]: Without dead ends: 67590 [2019-12-07 18:26:04,263 INFO L630 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 [2019-12-07 18:26:04,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67590 states. [2019-12-07 18:26:04,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67590 to 67588. [2019-12-07 18:26:04,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67588 states. [2019-12-07 18:26:04,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67588 states to 67588 states and 79874 transitions. [2019-12-07 18:26:04,971 INFO L78 Accepts]: Start accepts. Automaton has 67588 states and 79874 transitions. Word has length 28 [2019-12-07 18:26:04,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:04,971 INFO L462 AbstractCegarLoop]: Abstraction has 67588 states and 79874 transitions. [2019-12-07 18:26:04,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:26:04,972 INFO L276 IsEmpty]: Start isEmpty. Operand 67588 states and 79874 transitions. [2019-12-07 18:26:04,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:26:04,993 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:04,994 INFO L410 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] [2019-12-07 18:26:04,994 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:04,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:04,994 INFO L82 PathProgramCache]: Analyzing trace with hash -670020130, now seen corresponding path program 1 times [2019-12-07 18:26:04,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:04,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083991056] [2019-12-07 18:26:04,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:05,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:05,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083991056] [2019-12-07 18:26:05,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:05,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:26:05,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264320614] [2019-12-07 18:26:05,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:26:05,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:05,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:26:05,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:26:05,006 INFO L87 Difference]: Start difference. First operand 67588 states and 79874 transitions. Second operand 3 states. [2019-12-07 18:26:05,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:05,569 INFO L93 Difference]: Finished difference Result 71688 states and 86020 transitions. [2019-12-07 18:26:05,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:26:05,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 18:26:05,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:05,617 INFO L225 Difference]: With dead ends: 71688 [2019-12-07 18:26:05,617 INFO L226 Difference]: Without dead ends: 71686 [2019-12-07 18:26:05,625 INFO L630 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 [2019-12-07 18:26:05,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71686 states. [2019-12-07 18:26:06,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71686 to 67588. [2019-12-07 18:26:06,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67588 states. [2019-12-07 18:26:06,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67588 states to 67588 states and 78850 transitions. [2019-12-07 18:26:06,333 INFO L78 Accepts]: Start accepts. Automaton has 67588 states and 78850 transitions. Word has length 28 [2019-12-07 18:26:06,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:06,333 INFO L462 AbstractCegarLoop]: Abstraction has 67588 states and 78850 transitions. [2019-12-07 18:26:06,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:26:06,334 INFO L276 IsEmpty]: Start isEmpty. Operand 67588 states and 78850 transitions. [2019-12-07 18:26:06,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:26:06,356 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:06,356 INFO L410 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] [2019-12-07 18:26:06,356 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:06,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:06,356 INFO L82 PathProgramCache]: Analyzing trace with hash -316639795, now seen corresponding path program 1 times [2019-12-07 18:26:06,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:06,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795972797] [2019-12-07 18:26:06,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:06,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:06,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795972797] [2019-12-07 18:26:06,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:06,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:26:06,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601747465] [2019-12-07 18:26:06,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:26:06,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:06,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:26:06,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:26:06,379 INFO L87 Difference]: Start difference. First operand 67588 states and 78850 transitions. Second operand 3 states. [2019-12-07 18:26:07,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:07,044 INFO L93 Difference]: Finished difference Result 109574 states and 126979 transitions. [2019-12-07 18:26:07,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:26:07,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 18:26:07,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:07,122 INFO L225 Difference]: With dead ends: 109574 [2019-12-07 18:26:07,123 INFO L226 Difference]: Without dead ends: 109572 [2019-12-07 18:26:07,135 INFO L630 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 [2019-12-07 18:26:07,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109572 states. [2019-12-07 18:26:08,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109572 to 105476. [2019-12-07 18:26:08,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105476 states. [2019-12-07 18:26:08,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105476 states to 105476 states and 120834 transitions. [2019-12-07 18:26:08,311 INFO L78 Accepts]: Start accepts. Automaton has 105476 states and 120834 transitions. Word has length 29 [2019-12-07 18:26:08,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:08,311 INFO L462 AbstractCegarLoop]: Abstraction has 105476 states and 120834 transitions. [2019-12-07 18:26:08,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:26:08,311 INFO L276 IsEmpty]: Start isEmpty. Operand 105476 states and 120834 transitions. [2019-12-07 18:26:08,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:26:08,356 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:26:08,356 INFO L410 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] [2019-12-07 18:26:08,356 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:26:08,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:26:08,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1596503473, now seen corresponding path program 1 times [2019-12-07 18:26:08,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:26:08,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417561344] [2019-12-07 18:26:08,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:26:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:26:08,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:26:08,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417561344] [2019-12-07 18:26:08,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:26:08,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:26:08,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505726037] [2019-12-07 18:26:08,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:26:08,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:26:08,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:26:08,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:26:08,370 INFO L87 Difference]: Start difference. First operand 105476 states and 120834 transitions. Second operand 3 states. [2019-12-07 18:26:09,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:09,173 INFO L93 Difference]: Finished difference Result 236548 states and 268290 transitions. [2019-12-07 18:26:09,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:26:09,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 18:26:09,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:09,174 INFO L225 Difference]: With dead ends: 236548 [2019-12-07 18:26:09,174 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 18:26:09,223 INFO L630 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 [2019-12-07 18:26:09,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 18:26:09,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 18:26:09,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 18:26:09,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 18:26:09,224 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-12-07 18:26:09,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:09,224 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:26:09,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:26:09,225 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 18:26:09,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 18:26:09,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 18:26:09,253 INFO L246 CegarLoopResult]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2019-12-07 18:26:09,253 INFO L246 CegarLoopResult]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2019-12-07 18:26:09,253 INFO L246 CegarLoopResult]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2019-12-07 18:26:09,253 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-12-07 18:26:09,253 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 18:26:09,253 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 18:26:09,253 INFO L246 CegarLoopResult]: For program point L152(line 152) no Hoare annotation was computed. [2019-12-07 18:26:09,253 INFO L246 CegarLoopResult]: For program point L177(line 177) no Hoare annotation was computed. [2019-12-07 18:26:09,253 INFO L246 CegarLoopResult]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2019-12-07 18:26:09,254 INFO L246 CegarLoopResult]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2019-12-07 18:26:09,254 INFO L246 CegarLoopResult]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2019-12-07 18:26:09,254 INFO L246 CegarLoopResult]: For program point L112-1(lines 45 186) no Hoare annotation was computed. [2019-12-07 18:26:09,254 INFO L246 CegarLoopResult]: For program point L137(line 137) no Hoare annotation was computed. [2019-12-07 18:26:09,254 INFO L246 CegarLoopResult]: For program point L104-1(lines 45 186) no Hoare annotation was computed. [2019-12-07 18:26:09,254 INFO L246 CegarLoopResult]: For program point L162(line 162) no Hoare annotation was computed. [2019-12-07 18:26:09,254 INFO L246 CegarLoopResult]: For program point L96-1(lines 45 186) no Hoare annotation was computed. [2019-12-07 18:26:09,254 INFO L249 CegarLoopResult]: At program point L187(lines 5 191) the Hoare annotation is: true [2019-12-07 18:26:09,254 INFO L246 CegarLoopResult]: For program point L88-1(lines 45 186) no Hoare annotation was computed. [2019-12-07 18:26:09,254 INFO L246 CegarLoopResult]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2019-12-07 18:26:09,254 INFO L246 CegarLoopResult]: For program point L47(lines 47 49) no Hoare annotation was computed. [2019-12-07 18:26:09,254 INFO L246 CegarLoopResult]: For program point L80-1(lines 45 186) no Hoare annotation was computed. [2019-12-07 18:26:09,254 INFO L246 CegarLoopResult]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2019-12-07 18:26:09,254 INFO L246 CegarLoopResult]: For program point L147(line 147) no Hoare annotation was computed. [2019-12-07 18:26:09,254 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-12-07 18:26:09,255 INFO L246 CegarLoopResult]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2019-12-07 18:26:09,255 INFO L246 CegarLoopResult]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2019-12-07 18:26:09,255 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2019-12-07 18:26:09,255 INFO L249 CegarLoopResult]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2019-12-07 18:26:09,255 INFO L246 CegarLoopResult]: For program point L132(line 132) no Hoare annotation was computed. [2019-12-07 18:26:09,255 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 18:26:09,255 INFO L249 CegarLoopResult]: At program point L190(lines 4 191) the Hoare annotation is: true [2019-12-07 18:26:09,255 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-12-07 18:26:09,255 INFO L246 CegarLoopResult]: For program point L182(line 182) no Hoare annotation was computed. [2019-12-07 18:26:09,255 INFO L242 CegarLoopResult]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2019-12-07 18:26:09,255 INFO L246 CegarLoopResult]: For program point L116-1(lines 45 186) no Hoare annotation was computed. [2019-12-07 18:26:09,255 INFO L246 CegarLoopResult]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2019-12-07 18:26:09,255 INFO L246 CegarLoopResult]: For program point L108-1(lines 45 186) no Hoare annotation was computed. [2019-12-07 18:26:09,255 INFO L246 CegarLoopResult]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2019-12-07 18:26:09,255 INFO L246 CegarLoopResult]: For program point L100-1(lines 45 186) no Hoare annotation was computed. [2019-12-07 18:26:09,255 INFO L246 CegarLoopResult]: For program point L92-1(lines 45 186) no Hoare annotation was computed. [2019-12-07 18:26:09,256 INFO L246 CegarLoopResult]: For program point L84-1(lines 45 186) no Hoare annotation was computed. [2019-12-07 18:26:09,256 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-12-07 18:26:09,256 INFO L246 CegarLoopResult]: For program point L76(lines 76 78) no Hoare annotation was computed. [2019-12-07 18:26:09,256 INFO L246 CegarLoopResult]: For program point L76-2(lines 45 186) no Hoare annotation was computed. [2019-12-07 18:26:09,256 INFO L246 CegarLoopResult]: For program point L167(line 167) no Hoare annotation was computed. [2019-12-07 18:26:09,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:26:09 BoogieIcfgContainer [2019-12-07 18:26:09,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:26:09,263 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:26:09,264 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:26:09,264 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:26:09,264 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:25:58" (3/4) ... [2019-12-07 18:26:09,266 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 18:26:09,274 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 18:26:09,275 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 18:26:09,312 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ff709d9f-457d-4c56-b5e1-c4008b9f2652/bin/uautomizer/witness.graphml [2019-12-07 18:26:09,312 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:26:09,314 INFO L168 Benchmark]: Toolchain (without parser) took 11233.40 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 945.1 MB in the beginning and 768.5 MB in the end (delta: 176.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-12-07 18:26:09,314 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:26:09,314 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 945.1 MB in the beginning and 1.1 GB in the end (delta: -147.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:26:09,314 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.21 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:26:09,315 INFO L168 Benchmark]: Boogie Preprocessor took 16.83 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:26:09,315 INFO L168 Benchmark]: RCFGBuilder took 225.69 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: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:26:09,315 INFO L168 Benchmark]: TraceAbstraction took 10707.97 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 802.5 MB in the end (delta: 263.2 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-12-07 18:26:09,315 INFO L168 Benchmark]: Witness Printer took 48.83 ms. Allocated memory is still 2.3 GB. Free memory was 802.5 MB in the beginning and 768.5 MB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:26:09,317 INFO L335 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 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 206.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 945.1 MB in the beginning and 1.1 GB in the end (delta: -147.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.21 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.83 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 225.69 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: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10707.97 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 802.5 MB in the end (delta: 263.2 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 48.83 ms. Allocated memory is still 2.3 GB. Free memory was 802.5 MB in the beginning and 768.5 MB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 1 error locations. Result: SAFE, OverallTime: 10.6s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3198 SDtfs, 1629 SDslu, 2141 SDs, 0 SdLazy, 175 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105476occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 33 MinimizatonAttempts, 16418 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 4105 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 778 NumberOfCodeBlocks, 778 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 745 ConstructedInterpolants, 0 QuantifiedInterpolants, 38061 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...