./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_10.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_493fc637-e4f2-4fe2-88c1-0903eb90299e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_493fc637-e4f2-4fe2-88c1-0903eb90299e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_493fc637-e4f2-4fe2-88c1-0903eb90299e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_493fc637-e4f2-4fe2-88c1-0903eb90299e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_10.c -s /tmp/vcloud-vcloud-master/worker/run_dir_493fc637-e4f2-4fe2-88c1-0903eb90299e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_493fc637-e4f2-4fe2-88c1-0903eb90299e/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 0f7b0b589689413087c164ce10eb80c902ee4046 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 17:09:22,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:09:22,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:09:22,280 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:09:22,281 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:09:22,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:09:22,282 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:09:22,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:09:22,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:09:22,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:09:22,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:09:22,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:09:22,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:09:22,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:09:22,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:09:22,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:09:22,290 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:09:22,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:09:22,292 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:09:22,294 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:09:22,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:09:22,296 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:09:22,296 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:09:22,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:09:22,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:09:22,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:09:22,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:09:22,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:09:22,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:09:22,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:09:22,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:09:22,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:09:22,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:09:22,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:09:22,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:09:22,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:09:22,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:09:22,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:09:22,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:09:22,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:09:22,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:09:22,305 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_493fc637-e4f2-4fe2-88c1-0903eb90299e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:09:22,314 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:09:22,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:09:22,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:09:22,315 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:09:22,315 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:09:22,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:09:22,315 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:09:22,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:09:22,315 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:09:22,316 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:09:22,316 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:09:22,316 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:09:22,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:09:22,316 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:09:22,316 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:09:22,316 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:09:22,316 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:09:22,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:09:22,317 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:09:22,317 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:09:22,317 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:09:22,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:09:22,317 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:09:22,317 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:09:22,317 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:09:22,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:09:22,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:09:22,318 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:09:22,318 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:09:22,318 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_493fc637-e4f2-4fe2-88c1-0903eb90299e/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 -> 0f7b0b589689413087c164ce10eb80c902ee4046 [2019-12-07 17:09:22,430 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:09:22,440 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:09:22,443 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:09:22,445 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:09:22,445 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:09:22,446 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_493fc637-e4f2-4fe2-88c1-0903eb90299e/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_10.c [2019-12-07 17:09:22,492 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_493fc637-e4f2-4fe2-88c1-0903eb90299e/bin/uautomizer/data/525656a52/2e25e8e66e3a40c9b7dc5ff49f4cba1a/FLAGfa6e078c4 [2019-12-07 17:09:22,907 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:09:22,907 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_493fc637-e4f2-4fe2-88c1-0903eb90299e/sv-benchmarks/c/locks/test_locks_10.c [2019-12-07 17:09:22,912 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_493fc637-e4f2-4fe2-88c1-0903eb90299e/bin/uautomizer/data/525656a52/2e25e8e66e3a40c9b7dc5ff49f4cba1a/FLAGfa6e078c4 [2019-12-07 17:09:22,921 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_493fc637-e4f2-4fe2-88c1-0903eb90299e/bin/uautomizer/data/525656a52/2e25e8e66e3a40c9b7dc5ff49f4cba1a [2019-12-07 17:09:22,923 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:09:22,924 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:09:22,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:09:22,925 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:09:22,928 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:09:22,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:09:22" (1/1) ... [2019-12-07 17:09:22,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aaa2f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:09:22, skipping insertion in model container [2019-12-07 17:09:22,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:09:22" (1/1) ... [2019-12-07 17:09:22,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:09:22,956 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:09:23,063 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:09:23,099 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:09:23,122 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:09:23,131 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:09:23,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:09:23 WrapperNode [2019-12-07 17:09:23,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:09:23,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:09:23,132 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:09:23,132 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:09:23,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:09:23" (1/1) ... [2019-12-07 17:09:23,142 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:09:23" (1/1) ... [2019-12-07 17:09:23,156 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:09:23,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:09:23,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:09:23,156 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:09:23,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:09:23" (1/1) ... [2019-12-07 17:09:23,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:09:23" (1/1) ... [2019-12-07 17:09:23,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:09:23" (1/1) ... [2019-12-07 17:09:23,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:09:23" (1/1) ... [2019-12-07 17:09:23,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:09:23" (1/1) ... [2019-12-07 17:09:23,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:09:23" (1/1) ... [2019-12-07 17:09:23,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:09:23" (1/1) ... [2019-12-07 17:09:23,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:09:23,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:09:23,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:09:23,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:09:23,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:09:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_493fc637-e4f2-4fe2-88c1-0903eb90299e/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 17:09:23,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:09:23,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:09:23,377 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:09:23,377 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-12-07 17:09:23,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:09:23 BoogieIcfgContainer [2019-12-07 17:09:23,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:09:23,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:09:23,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:09:23,381 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:09:23,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:09:22" (1/3) ... [2019-12-07 17:09:23,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5215b70a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:09:23, skipping insertion in model container [2019-12-07 17:09:23,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:09:23" (2/3) ... [2019-12-07 17:09:23,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5215b70a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:09:23, skipping insertion in model container [2019-12-07 17:09:23,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:09:23" (3/3) ... [2019-12-07 17:09:23,383 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2019-12-07 17:09:23,389 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:09:23,393 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:09:23,400 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:09:23,417 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:09:23,417 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:09:23,417 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:09:23,417 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:09:23,417 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:09:23,418 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:09:23,418 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:09:23,418 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:09:23,428 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2019-12-07 17:09:23,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:09:23,432 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:23,432 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:09:23,433 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:23,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:23,436 INFO L82 PathProgramCache]: Analyzing trace with hash -977352837, now seen corresponding path program 1 times [2019-12-07 17:09:23,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:23,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631429598] [2019-12-07 17:09:23,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:23,562 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 17:09:23,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631429598] [2019-12-07 17:09:23,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:23,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:23,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638967682] [2019-12-07 17:09:23,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:23,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:23,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:23,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:23,578 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2019-12-07 17:09:23,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:23,614 INFO L93 Difference]: Finished difference Result 82 states and 144 transitions. [2019-12-07 17:09:23,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:23,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 17:09:23,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:23,623 INFO L225 Difference]: With dead ends: 82 [2019-12-07 17:09:23,623 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 17:09:23,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 17:09:23,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 17:09:23,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2019-12-07 17:09:23,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 17:09:23,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 85 transitions. [2019-12-07 17:09:23,651 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 85 transitions. Word has length 16 [2019-12-07 17:09:23,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:23,652 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 85 transitions. [2019-12-07 17:09:23,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:23,652 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 85 transitions. [2019-12-07 17:09:23,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:09:23,653 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:23,653 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:09:23,653 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:23,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:23,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1564158851, now seen corresponding path program 1 times [2019-12-07 17:09:23,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:23,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943097197] [2019-12-07 17:09:23,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:23,686 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 17:09:23,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943097197] [2019-12-07 17:09:23,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:23,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:23,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120233737] [2019-12-07 17:09:23,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:23,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:23,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:23,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:23,688 INFO L87 Difference]: Start difference. First operand 46 states and 85 transitions. Second operand 3 states. [2019-12-07 17:09:23,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:23,703 INFO L93 Difference]: Finished difference Result 113 states and 208 transitions. [2019-12-07 17:09:23,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:23,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 17:09:23,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:23,705 INFO L225 Difference]: With dead ends: 113 [2019-12-07 17:09:23,705 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 17:09:23,705 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 17:09:23,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 17:09:23,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-12-07 17:09:23,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 17:09:23,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 121 transitions. [2019-12-07 17:09:23,712 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 121 transitions. Word has length 16 [2019-12-07 17:09:23,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:23,713 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 121 transitions. [2019-12-07 17:09:23,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:23,713 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 121 transitions. [2019-12-07 17:09:23,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:09:23,713 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:23,713 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:09:23,713 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:23,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:23,714 INFO L82 PathProgramCache]: Analyzing trace with hash -232953528, now seen corresponding path program 1 times [2019-12-07 17:09:23,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:23,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610648261] [2019-12-07 17:09:23,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:23,741 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 17:09:23,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610648261] [2019-12-07 17:09:23,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:23,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:23,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362827611] [2019-12-07 17:09:23,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:23,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:23,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:23,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:23,742 INFO L87 Difference]: Start difference. First operand 66 states and 121 transitions. Second operand 3 states. [2019-12-07 17:09:23,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:23,756 INFO L93 Difference]: Finished difference Result 104 states and 185 transitions. [2019-12-07 17:09:23,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:23,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 17:09:23,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:23,757 INFO L225 Difference]: With dead ends: 104 [2019-12-07 17:09:23,757 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 17:09:23,758 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 17:09:23,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 17:09:23,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-12-07 17:09:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-12-07 17:09:23,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 123 transitions. [2019-12-07 17:09:23,764 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 123 transitions. Word has length 17 [2019-12-07 17:09:23,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:23,764 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 123 transitions. [2019-12-07 17:09:23,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:23,764 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 123 transitions. [2019-12-07 17:09:23,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:09:23,765 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:23,765 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:09:23,765 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:23,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:23,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1244070778, now seen corresponding path program 1 times [2019-12-07 17:09:23,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:23,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341528777] [2019-12-07 17:09:23,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:23,789 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 17:09:23,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341528777] [2019-12-07 17:09:23,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:23,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:23,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540854306] [2019-12-07 17:09:23,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:23,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:23,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:23,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:23,790 INFO L87 Difference]: Start difference. First operand 69 states and 123 transitions. Second operand 3 states. [2019-12-07 17:09:23,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:23,802 INFO L93 Difference]: Finished difference Result 132 states and 236 transitions. [2019-12-07 17:09:23,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:23,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 17:09:23,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:23,804 INFO L225 Difference]: With dead ends: 132 [2019-12-07 17:09:23,804 INFO L226 Difference]: Without dead ends: 130 [2019-12-07 17:09:23,804 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 17:09:23,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-12-07 17:09:23,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 92. [2019-12-07 17:09:23,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-07 17:09:23,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 164 transitions. [2019-12-07 17:09:23,811 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 164 transitions. Word has length 17 [2019-12-07 17:09:23,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:23,811 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 164 transitions. [2019-12-07 17:09:23,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:23,811 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 164 transitions. [2019-12-07 17:09:23,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:09:23,812 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:23,812 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:09:23,812 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:23,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:23,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1830876792, now seen corresponding path program 1 times [2019-12-07 17:09:23,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:23,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592335125] [2019-12-07 17:09:23,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:23,833 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 17:09:23,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592335125] [2019-12-07 17:09:23,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:23,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:23,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023361525] [2019-12-07 17:09:23,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:23,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:23,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:23,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:23,834 INFO L87 Difference]: Start difference. First operand 92 states and 164 transitions. Second operand 3 states. [2019-12-07 17:09:23,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:23,849 INFO L93 Difference]: Finished difference Result 220 states and 394 transitions. [2019-12-07 17:09:23,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:23,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 17:09:23,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:23,851 INFO L225 Difference]: With dead ends: 220 [2019-12-07 17:09:23,851 INFO L226 Difference]: Without dead ends: 132 [2019-12-07 17:09:23,852 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 17:09:23,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-12-07 17:09:23,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2019-12-07 17:09:23,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-12-07 17:09:23,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 230 transitions. [2019-12-07 17:09:23,862 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 230 transitions. Word has length 17 [2019-12-07 17:09:23,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:23,862 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 230 transitions. [2019-12-07 17:09:23,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:23,862 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 230 transitions. [2019-12-07 17:09:23,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:09:23,863 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:23,864 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 17:09:23,864 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:23,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:23,864 INFO L82 PathProgramCache]: Analyzing trace with hash 88725234, now seen corresponding path program 1 times [2019-12-07 17:09:23,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:23,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212260307] [2019-12-07 17:09:23,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:23,889 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 17:09:23,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212260307] [2019-12-07 17:09:23,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:23,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:23,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409296953] [2019-12-07 17:09:23,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:23,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:23,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:23,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:23,891 INFO L87 Difference]: Start difference. First operand 130 states and 230 transitions. Second operand 3 states. [2019-12-07 17:09:23,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:23,903 INFO L93 Difference]: Finished difference Result 197 states and 345 transitions. [2019-12-07 17:09:23,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:23,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 17:09:23,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:23,905 INFO L225 Difference]: With dead ends: 197 [2019-12-07 17:09:23,905 INFO L226 Difference]: Without dead ends: 134 [2019-12-07 17:09:23,905 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 17:09:23,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-12-07 17:09:23,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2019-12-07 17:09:23,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-12-07 17:09:23,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 230 transitions. [2019-12-07 17:09:23,915 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 230 transitions. Word has length 18 [2019-12-07 17:09:23,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:23,915 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 230 transitions. [2019-12-07 17:09:23,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:23,915 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 230 transitions. [2019-12-07 17:09:23,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:09:23,916 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:23,916 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 17:09:23,917 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:23,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:23,917 INFO L82 PathProgramCache]: Analyzing trace with hash -922392016, now seen corresponding path program 1 times [2019-12-07 17:09:23,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:23,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937883270] [2019-12-07 17:09:23,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:23,938 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 17:09:23,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937883270] [2019-12-07 17:09:23,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:23,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:23,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919653859] [2019-12-07 17:09:23,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:23,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:23,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:23,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:23,940 INFO L87 Difference]: Start difference. First operand 132 states and 230 transitions. Second operand 3 states. [2019-12-07 17:09:23,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:23,952 INFO L93 Difference]: Finished difference Result 380 states and 664 transitions. [2019-12-07 17:09:23,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:23,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 17:09:23,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:23,954 INFO L225 Difference]: With dead ends: 380 [2019-12-07 17:09:23,955 INFO L226 Difference]: Without dead ends: 254 [2019-12-07 17:09:23,955 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 17:09:23,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-12-07 17:09:23,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2019-12-07 17:09:23,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-12-07 17:09:23,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 434 transitions. [2019-12-07 17:09:23,968 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 434 transitions. Word has length 18 [2019-12-07 17:09:23,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:23,969 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 434 transitions. [2019-12-07 17:09:23,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:23,969 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 434 transitions. [2019-12-07 17:09:23,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:09:23,970 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:23,971 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 17:09:23,971 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:23,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:23,971 INFO L82 PathProgramCache]: Analyzing trace with hash -335586002, now seen corresponding path program 1 times [2019-12-07 17:09:23,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:23,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82308018] [2019-12-07 17:09:23,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:23,992 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 17:09:23,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82308018] [2019-12-07 17:09:23,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:23,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:23,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214483233] [2019-12-07 17:09:23,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:23,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:23,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:23,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:23,994 INFO L87 Difference]: Start difference. First operand 252 states and 434 transitions. Second operand 3 states. [2019-12-07 17:09:24,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:24,006 INFO L93 Difference]: Finished difference Result 320 states and 556 transitions. [2019-12-07 17:09:24,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:24,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 17:09:24,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:24,008 INFO L225 Difference]: With dead ends: 320 [2019-12-07 17:09:24,008 INFO L226 Difference]: Without dead ends: 318 [2019-12-07 17:09:24,009 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 17:09:24,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-12-07 17:09:24,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 252. [2019-12-07 17:09:24,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-12-07 17:09:24,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 430 transitions. [2019-12-07 17:09:24,015 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 430 transitions. Word has length 18 [2019-12-07 17:09:24,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:24,015 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 430 transitions. [2019-12-07 17:09:24,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:24,016 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 430 transitions. [2019-12-07 17:09:24,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:09:24,017 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:24,017 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 17:09:24,017 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:24,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:24,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1470832605, now seen corresponding path program 1 times [2019-12-07 17:09:24,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:24,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347446254] [2019-12-07 17:09:24,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:24,031 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 17:09:24,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347446254] [2019-12-07 17:09:24,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:24,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:24,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381201789] [2019-12-07 17:09:24,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:24,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:24,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:24,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:24,033 INFO L87 Difference]: Start difference. First operand 252 states and 430 transitions. Second operand 3 states. [2019-12-07 17:09:24,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:24,048 INFO L93 Difference]: Finished difference Result 468 states and 808 transitions. [2019-12-07 17:09:24,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:24,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 17:09:24,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:24,050 INFO L225 Difference]: With dead ends: 468 [2019-12-07 17:09:24,050 INFO L226 Difference]: Without dead ends: 466 [2019-12-07 17:09:24,051 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 17:09:24,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-12-07 17:09:24,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 352. [2019-12-07 17:09:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-12-07 17:09:24,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 590 transitions. [2019-12-07 17:09:24,061 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 590 transitions. Word has length 19 [2019-12-07 17:09:24,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:24,062 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 590 transitions. [2019-12-07 17:09:24,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:24,062 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 590 transitions. [2019-12-07 17:09:24,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:09:24,063 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:24,063 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 17:09:24,063 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:24,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:24,064 INFO L82 PathProgramCache]: Analyzing trace with hash 884026591, now seen corresponding path program 1 times [2019-12-07 17:09:24,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:24,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52786895] [2019-12-07 17:09:24,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:24,080 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 17:09:24,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52786895] [2019-12-07 17:09:24,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:24,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:24,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130270636] [2019-12-07 17:09:24,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:24,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:24,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:24,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:24,081 INFO L87 Difference]: Start difference. First operand 352 states and 590 transitions. Second operand 3 states. [2019-12-07 17:09:24,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:24,097 INFO L93 Difference]: Finished difference Result 836 states and 1408 transitions. [2019-12-07 17:09:24,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:24,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 17:09:24,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:24,100 INFO L225 Difference]: With dead ends: 836 [2019-12-07 17:09:24,101 INFO L226 Difference]: Without dead ends: 490 [2019-12-07 17:09:24,102 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 17:09:24,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-12-07 17:09:24,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 488. [2019-12-07 17:09:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-12-07 17:09:24,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 810 transitions. [2019-12-07 17:09:24,114 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 810 transitions. Word has length 19 [2019-12-07 17:09:24,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:24,115 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 810 transitions. [2019-12-07 17:09:24,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:24,115 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 810 transitions. [2019-12-07 17:09:24,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:09:24,116 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:24,116 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 17:09:24,117 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:24,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:24,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1648615131, now seen corresponding path program 1 times [2019-12-07 17:09:24,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:24,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397571390] [2019-12-07 17:09:24,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:24,134 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 17:09:24,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397571390] [2019-12-07 17:09:24,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:24,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:24,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809223212] [2019-12-07 17:09:24,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:24,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:24,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:24,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:24,135 INFO L87 Difference]: Start difference. First operand 488 states and 810 transitions. Second operand 3 states. [2019-12-07 17:09:24,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:24,150 INFO L93 Difference]: Finished difference Result 740 states and 1224 transitions. [2019-12-07 17:09:24,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:24,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 17:09:24,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:24,153 INFO L225 Difference]: With dead ends: 740 [2019-12-07 17:09:24,153 INFO L226 Difference]: Without dead ends: 502 [2019-12-07 17:09:24,153 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 17:09:24,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-12-07 17:09:24,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 500. [2019-12-07 17:09:24,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-12-07 17:09:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 818 transitions. [2019-12-07 17:09:24,165 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 818 transitions. Word has length 20 [2019-12-07 17:09:24,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:24,165 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 818 transitions. [2019-12-07 17:09:24,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:24,165 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 818 transitions. [2019-12-07 17:09:24,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:09:24,166 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:24,166 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 17:09:24,166 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:24,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:24,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1635234915, now seen corresponding path program 1 times [2019-12-07 17:09:24,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:24,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545173990] [2019-12-07 17:09:24,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:24,180 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 17:09:24,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545173990] [2019-12-07 17:09:24,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:24,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:24,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77943721] [2019-12-07 17:09:24,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:24,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:24,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:24,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:24,182 INFO L87 Difference]: Start difference. First operand 500 states and 818 transitions. Second operand 3 states. [2019-12-07 17:09:24,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:24,201 INFO L93 Difference]: Finished difference Result 904 states and 1500 transitions. [2019-12-07 17:09:24,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:24,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 17:09:24,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:24,206 INFO L225 Difference]: With dead ends: 904 [2019-12-07 17:09:24,206 INFO L226 Difference]: Without dead ends: 902 [2019-12-07 17:09:24,207 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 17:09:24,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2019-12-07 17:09:24,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 708. [2019-12-07 17:09:24,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-12-07 17:09:24,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1130 transitions. [2019-12-07 17:09:24,221 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1130 transitions. Word has length 20 [2019-12-07 17:09:24,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:24,221 INFO L462 AbstractCegarLoop]: Abstraction has 708 states and 1130 transitions. [2019-12-07 17:09:24,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:24,222 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1130 transitions. [2019-12-07 17:09:24,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:09:24,223 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:24,223 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 17:09:24,223 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:24,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:24,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1048428901, now seen corresponding path program 1 times [2019-12-07 17:09:24,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:24,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5033586] [2019-12-07 17:09:24,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:24,236 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 17:09:24,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5033586] [2019-12-07 17:09:24,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:24,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:24,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522415536] [2019-12-07 17:09:24,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:24,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:24,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:24,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:24,238 INFO L87 Difference]: Start difference. First operand 708 states and 1130 transitions. Second operand 3 states. [2019-12-07 17:09:24,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:24,263 INFO L93 Difference]: Finished difference Result 1656 states and 2652 transitions. [2019-12-07 17:09:24,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:24,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 17:09:24,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:24,268 INFO L225 Difference]: With dead ends: 1656 [2019-12-07 17:09:24,269 INFO L226 Difference]: Without dead ends: 966 [2019-12-07 17:09:24,270 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 17:09:24,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-12-07 17:09:24,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 964. [2019-12-07 17:09:24,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2019-12-07 17:09:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1522 transitions. [2019-12-07 17:09:24,299 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1522 transitions. Word has length 20 [2019-12-07 17:09:24,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:24,299 INFO L462 AbstractCegarLoop]: Abstraction has 964 states and 1522 transitions. [2019-12-07 17:09:24,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:24,299 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1522 transitions. [2019-12-07 17:09:24,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:09:24,300 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:24,300 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 17:09:24,300 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:24,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:24,301 INFO L82 PathProgramCache]: Analyzing trace with hash -847110476, now seen corresponding path program 1 times [2019-12-07 17:09:24,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:24,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632884539] [2019-12-07 17:09:24,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:24,314 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 17:09:24,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632884539] [2019-12-07 17:09:24,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:24,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:24,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179778141] [2019-12-07 17:09:24,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:24,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:24,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:24,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:24,315 INFO L87 Difference]: Start difference. First operand 964 states and 1522 transitions. Second operand 3 states. [2019-12-07 17:09:24,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:24,338 INFO L93 Difference]: Finished difference Result 1448 states and 2276 transitions. [2019-12-07 17:09:24,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:24,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 17:09:24,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:24,344 INFO L225 Difference]: With dead ends: 1448 [2019-12-07 17:09:24,344 INFO L226 Difference]: Without dead ends: 982 [2019-12-07 17:09:24,345 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 17:09:24,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-12-07 17:09:24,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 980. [2019-12-07 17:09:24,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-12-07 17:09:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1522 transitions. [2019-12-07 17:09:24,375 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1522 transitions. Word has length 21 [2019-12-07 17:09:24,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:24,375 INFO L462 AbstractCegarLoop]: Abstraction has 980 states and 1522 transitions. [2019-12-07 17:09:24,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:24,375 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1522 transitions. [2019-12-07 17:09:24,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:09:24,377 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:24,377 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 17:09:24,377 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:24,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:24,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1858227726, now seen corresponding path program 1 times [2019-12-07 17:09:24,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:24,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509163168] [2019-12-07 17:09:24,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:24,392 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 17:09:24,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509163168] [2019-12-07 17:09:24,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:24,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:24,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948580517] [2019-12-07 17:09:24,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:24,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:24,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:24,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:24,394 INFO L87 Difference]: Start difference. First operand 980 states and 1522 transitions. Second operand 3 states. [2019-12-07 17:09:24,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:24,424 INFO L93 Difference]: Finished difference Result 1736 states and 2740 transitions. [2019-12-07 17:09:24,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:24,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 17:09:24,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:24,434 INFO L225 Difference]: With dead ends: 1736 [2019-12-07 17:09:24,434 INFO L226 Difference]: Without dead ends: 1734 [2019-12-07 17:09:24,434 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 17:09:24,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-12-07 17:09:24,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1412. [2019-12-07 17:09:24,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-12-07 17:09:24,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2130 transitions. [2019-12-07 17:09:24,475 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2130 transitions. Word has length 21 [2019-12-07 17:09:24,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:24,475 INFO L462 AbstractCegarLoop]: Abstraction has 1412 states and 2130 transitions. [2019-12-07 17:09:24,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:24,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2130 transitions. [2019-12-07 17:09:24,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:09:24,477 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:24,477 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 17:09:24,477 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:24,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:24,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1849933556, now seen corresponding path program 1 times [2019-12-07 17:09:24,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:24,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243740203] [2019-12-07 17:09:24,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:24,489 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 17:09:24,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243740203] [2019-12-07 17:09:24,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:24,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:24,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734792682] [2019-12-07 17:09:24,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:24,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:24,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:24,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:24,491 INFO L87 Difference]: Start difference. First operand 1412 states and 2130 transitions. Second operand 3 states. [2019-12-07 17:09:24,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:24,532 INFO L93 Difference]: Finished difference Result 3272 states and 4948 transitions. [2019-12-07 17:09:24,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:24,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 17:09:24,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:24,542 INFO L225 Difference]: With dead ends: 3272 [2019-12-07 17:09:24,543 INFO L226 Difference]: Without dead ends: 1894 [2019-12-07 17:09:24,545 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 17:09:24,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2019-12-07 17:09:24,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1892. [2019-12-07 17:09:24,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1892 states. [2019-12-07 17:09:24,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2818 transitions. [2019-12-07 17:09:24,608 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2818 transitions. Word has length 21 [2019-12-07 17:09:24,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:24,608 INFO L462 AbstractCegarLoop]: Abstraction has 1892 states and 2818 transitions. [2019-12-07 17:09:24,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:24,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2818 transitions. [2019-12-07 17:09:24,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:09:24,610 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:24,610 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 17:09:24,610 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:24,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:24,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1770269606, now seen corresponding path program 1 times [2019-12-07 17:09:24,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:24,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138540048] [2019-12-07 17:09:24,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:24,622 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 17:09:24,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138540048] [2019-12-07 17:09:24,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:24,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:24,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224867541] [2019-12-07 17:09:24,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:24,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:24,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:24,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:24,624 INFO L87 Difference]: Start difference. First operand 1892 states and 2818 transitions. Second operand 3 states. [2019-12-07 17:09:24,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:24,649 INFO L93 Difference]: Finished difference Result 2840 states and 4212 transitions. [2019-12-07 17:09:24,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:24,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 17:09:24,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:24,657 INFO L225 Difference]: With dead ends: 2840 [2019-12-07 17:09:24,657 INFO L226 Difference]: Without dead ends: 1926 [2019-12-07 17:09:24,658 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 17:09:24,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2019-12-07 17:09:24,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1924. [2019-12-07 17:09:24,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1924 states. [2019-12-07 17:09:24,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2818 transitions. [2019-12-07 17:09:24,695 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2818 transitions. Word has length 22 [2019-12-07 17:09:24,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:24,695 INFO L462 AbstractCegarLoop]: Abstraction has 1924 states and 2818 transitions. [2019-12-07 17:09:24,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:24,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2818 transitions. [2019-12-07 17:09:24,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:09:24,697 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:24,697 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 17:09:24,697 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:24,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:24,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1513580440, now seen corresponding path program 1 times [2019-12-07 17:09:24,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:24,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555007294] [2019-12-07 17:09:24,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:24,708 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 17:09:24,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555007294] [2019-12-07 17:09:24,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:24,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:24,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039693609] [2019-12-07 17:09:24,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:24,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:24,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:24,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:24,709 INFO L87 Difference]: Start difference. First operand 1924 states and 2818 transitions. Second operand 3 states. [2019-12-07 17:09:24,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:24,742 INFO L93 Difference]: Finished difference Result 3336 states and 4964 transitions. [2019-12-07 17:09:24,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:24,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 17:09:24,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:24,756 INFO L225 Difference]: With dead ends: 3336 [2019-12-07 17:09:24,756 INFO L226 Difference]: Without dead ends: 3334 [2019-12-07 17:09:24,757 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 17:09:24,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2019-12-07 17:09:24,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 2820. [2019-12-07 17:09:24,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2820 states. [2019-12-07 17:09:24,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 4002 transitions. [2019-12-07 17:09:24,810 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 4002 transitions. Word has length 22 [2019-12-07 17:09:24,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:24,810 INFO L462 AbstractCegarLoop]: Abstraction has 2820 states and 4002 transitions. [2019-12-07 17:09:24,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:24,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 4002 transitions. [2019-12-07 17:09:24,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:09:24,813 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:24,813 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 17:09:24,813 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:24,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:24,813 INFO L82 PathProgramCache]: Analyzing trace with hash 926774426, now seen corresponding path program 1 times [2019-12-07 17:09:24,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:24,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441652522] [2019-12-07 17:09:24,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:24,823 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 17:09:24,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441652522] [2019-12-07 17:09:24,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:24,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:24,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363538803] [2019-12-07 17:09:24,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:24,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:24,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:24,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:24,825 INFO L87 Difference]: Start difference. First operand 2820 states and 4002 transitions. Second operand 3 states. [2019-12-07 17:09:24,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:24,864 INFO L93 Difference]: Finished difference Result 6472 states and 9188 transitions. [2019-12-07 17:09:24,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:24,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 17:09:24,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:24,878 INFO L225 Difference]: With dead ends: 6472 [2019-12-07 17:09:24,878 INFO L226 Difference]: Without dead ends: 3718 [2019-12-07 17:09:24,881 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 17:09:24,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2019-12-07 17:09:24,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 3716. [2019-12-07 17:09:24,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3716 states. [2019-12-07 17:09:24,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3716 states to 3716 states and 5186 transitions. [2019-12-07 17:09:24,950 INFO L78 Accepts]: Start accepts. Automaton has 3716 states and 5186 transitions. Word has length 22 [2019-12-07 17:09:24,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:24,950 INFO L462 AbstractCegarLoop]: Abstraction has 3716 states and 5186 transitions. [2019-12-07 17:09:24,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:24,950 INFO L276 IsEmpty]: Start isEmpty. Operand 3716 states and 5186 transitions. [2019-12-07 17:09:24,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 17:09:24,953 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:24,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] [2019-12-07 17:09:24,953 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:24,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:24,953 INFO L82 PathProgramCache]: Analyzing trace with hash -323431223, now seen corresponding path program 1 times [2019-12-07 17:09:24,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:24,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795600322] [2019-12-07 17:09:24,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:24,962 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 17:09:24,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795600322] [2019-12-07 17:09:24,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:24,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:24,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463963440] [2019-12-07 17:09:24,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:24,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:24,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:24,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:24,964 INFO L87 Difference]: Start difference. First operand 3716 states and 5186 transitions. Second operand 3 states. [2019-12-07 17:09:25,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:25,011 INFO L93 Difference]: Finished difference Result 5576 states and 7748 transitions. [2019-12-07 17:09:25,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:25,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 17:09:25,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:25,030 INFO L225 Difference]: With dead ends: 5576 [2019-12-07 17:09:25,030 INFO L226 Difference]: Without dead ends: 3782 [2019-12-07 17:09:25,033 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 17:09:25,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3782 states. [2019-12-07 17:09:25,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3782 to 3780. [2019-12-07 17:09:25,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3780 states. [2019-12-07 17:09:25,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3780 states to 3780 states and 5186 transitions. [2019-12-07 17:09:25,112 INFO L78 Accepts]: Start accepts. Automaton has 3780 states and 5186 transitions. Word has length 23 [2019-12-07 17:09:25,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:25,113 INFO L462 AbstractCegarLoop]: Abstraction has 3780 states and 5186 transitions. [2019-12-07 17:09:25,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:25,113 INFO L276 IsEmpty]: Start isEmpty. Operand 3780 states and 5186 transitions. [2019-12-07 17:09:25,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 17:09:25,115 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:25,116 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 17:09:25,116 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:25,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:25,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1334548473, now seen corresponding path program 1 times [2019-12-07 17:09:25,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:25,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283970757] [2019-12-07 17:09:25,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:25,127 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 17:09:25,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283970757] [2019-12-07 17:09:25,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:25,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:25,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920105738] [2019-12-07 17:09:25,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:25,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:25,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:25,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:25,129 INFO L87 Difference]: Start difference. First operand 3780 states and 5186 transitions. Second operand 3 states. [2019-12-07 17:09:25,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:25,182 INFO L93 Difference]: Finished difference Result 6408 states and 8900 transitions. [2019-12-07 17:09:25,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:25,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 17:09:25,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:25,206 INFO L225 Difference]: With dead ends: 6408 [2019-12-07 17:09:25,206 INFO L226 Difference]: Without dead ends: 6406 [2019-12-07 17:09:25,208 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 17:09:25,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6406 states. [2019-12-07 17:09:25,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6406 to 5636. [2019-12-07 17:09:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5636 states. [2019-12-07 17:09:25,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5636 states to 5636 states and 7490 transitions. [2019-12-07 17:09:25,299 INFO L78 Accepts]: Start accepts. Automaton has 5636 states and 7490 transitions. Word has length 23 [2019-12-07 17:09:25,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:25,300 INFO L462 AbstractCegarLoop]: Abstraction has 5636 states and 7490 transitions. [2019-12-07 17:09:25,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:25,300 INFO L276 IsEmpty]: Start isEmpty. Operand 5636 states and 7490 transitions. [2019-12-07 17:09:25,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 17:09:25,305 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:25,305 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 17:09:25,305 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:25,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:25,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1921354487, now seen corresponding path program 1 times [2019-12-07 17:09:25,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:25,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952551585] [2019-12-07 17:09:25,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:25,318 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 17:09:25,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952551585] [2019-12-07 17:09:25,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:25,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:25,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175696886] [2019-12-07 17:09:25,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:25,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:25,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:25,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:25,319 INFO L87 Difference]: Start difference. First operand 5636 states and 7490 transitions. Second operand 3 states. [2019-12-07 17:09:25,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:25,406 INFO L93 Difference]: Finished difference Result 12808 states and 16964 transitions. [2019-12-07 17:09:25,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:25,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 17:09:25,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:25,418 INFO L225 Difference]: With dead ends: 12808 [2019-12-07 17:09:25,419 INFO L226 Difference]: Without dead ends: 7302 [2019-12-07 17:09:25,424 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 17:09:25,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7302 states. [2019-12-07 17:09:25,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7302 to 7300. [2019-12-07 17:09:25,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7300 states. [2019-12-07 17:09:25,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7300 states to 7300 states and 9474 transitions. [2019-12-07 17:09:25,548 INFO L78 Accepts]: Start accepts. Automaton has 7300 states and 9474 transitions. Word has length 23 [2019-12-07 17:09:25,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:25,548 INFO L462 AbstractCegarLoop]: Abstraction has 7300 states and 9474 transitions. [2019-12-07 17:09:25,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:25,548 INFO L276 IsEmpty]: Start isEmpty. Operand 7300 states and 9474 transitions. [2019-12-07 17:09:25,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 17:09:25,554 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:25,554 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 17:09:25,554 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:25,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:25,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1578886031, now seen corresponding path program 1 times [2019-12-07 17:09:25,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:25,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017902108] [2019-12-07 17:09:25,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:25,570 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 17:09:25,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017902108] [2019-12-07 17:09:25,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:25,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:25,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398750273] [2019-12-07 17:09:25,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:25,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:25,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:25,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:25,572 INFO L87 Difference]: Start difference. First operand 7300 states and 9474 transitions. Second operand 3 states. [2019-12-07 17:09:25,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:25,644 INFO L93 Difference]: Finished difference Result 10952 states and 14148 transitions. [2019-12-07 17:09:25,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:25,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 17:09:25,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:25,653 INFO L225 Difference]: With dead ends: 10952 [2019-12-07 17:09:25,653 INFO L226 Difference]: Without dead ends: 7430 [2019-12-07 17:09:25,657 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 17:09:25,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7430 states. [2019-12-07 17:09:25,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7430 to 7428. [2019-12-07 17:09:25,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7428 states. [2019-12-07 17:09:25,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7428 states to 7428 states and 9474 transitions. [2019-12-07 17:09:25,768 INFO L78 Accepts]: Start accepts. Automaton has 7428 states and 9474 transitions. Word has length 24 [2019-12-07 17:09:25,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:25,768 INFO L462 AbstractCegarLoop]: Abstraction has 7428 states and 9474 transitions. [2019-12-07 17:09:25,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:25,769 INFO L276 IsEmpty]: Start isEmpty. Operand 7428 states and 9474 transitions. [2019-12-07 17:09:25,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 17:09:25,774 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:25,774 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 17:09:25,774 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:25,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:25,774 INFO L82 PathProgramCache]: Analyzing trace with hash 567768781, now seen corresponding path program 1 times [2019-12-07 17:09:25,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:25,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156731417] [2019-12-07 17:09:25,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:25,784 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 17:09:25,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156731417] [2019-12-07 17:09:25,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:25,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:25,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833607782] [2019-12-07 17:09:25,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:25,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:25,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:25,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:25,786 INFO L87 Difference]: Start difference. First operand 7428 states and 9474 transitions. Second operand 3 states. [2019-12-07 17:09:25,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:25,909 INFO L93 Difference]: Finished difference Result 12296 states and 15748 transitions. [2019-12-07 17:09:25,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:25,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 17:09:25,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:25,925 INFO L225 Difference]: With dead ends: 12296 [2019-12-07 17:09:25,925 INFO L226 Difference]: Without dead ends: 12294 [2019-12-07 17:09:25,927 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 17:09:25,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12294 states. [2019-12-07 17:09:26,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12294 to 11268. [2019-12-07 17:09:26,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11268 states. [2019-12-07 17:09:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11268 states to 11268 states and 13954 transitions. [2019-12-07 17:09:26,057 INFO L78 Accepts]: Start accepts. Automaton has 11268 states and 13954 transitions. Word has length 24 [2019-12-07 17:09:26,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:26,057 INFO L462 AbstractCegarLoop]: Abstraction has 11268 states and 13954 transitions. [2019-12-07 17:09:26,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:26,057 INFO L276 IsEmpty]: Start isEmpty. Operand 11268 states and 13954 transitions. [2019-12-07 17:09:26,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 17:09:26,068 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:26,068 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 17:09:26,068 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:26,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:26,068 INFO L82 PathProgramCache]: Analyzing trace with hash -19037233, now seen corresponding path program 1 times [2019-12-07 17:09:26,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:26,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490726964] [2019-12-07 17:09:26,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:26,078 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 17:09:26,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490726964] [2019-12-07 17:09:26,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:26,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:26,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314318463] [2019-12-07 17:09:26,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:26,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:26,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:26,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:26,079 INFO L87 Difference]: Start difference. First operand 11268 states and 13954 transitions. Second operand 3 states. [2019-12-07 17:09:26,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:26,187 INFO L93 Difference]: Finished difference Result 25352 states and 31108 transitions. [2019-12-07 17:09:26,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:26,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 17:09:26,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:26,202 INFO L225 Difference]: With dead ends: 25352 [2019-12-07 17:09:26,202 INFO L226 Difference]: Without dead ends: 14342 [2019-12-07 17:09:26,212 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 17:09:26,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14342 states. [2019-12-07 17:09:26,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14342 to 14340. [2019-12-07 17:09:26,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14340 states. [2019-12-07 17:09:26,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14340 states to 14340 states and 17154 transitions. [2019-12-07 17:09:26,409 INFO L78 Accepts]: Start accepts. Automaton has 14340 states and 17154 transitions. Word has length 24 [2019-12-07 17:09:26,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:26,409 INFO L462 AbstractCegarLoop]: Abstraction has 14340 states and 17154 transitions. [2019-12-07 17:09:26,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:26,410 INFO L276 IsEmpty]: Start isEmpty. Operand 14340 states and 17154 transitions. [2019-12-07 17:09:26,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:09:26,420 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:26,420 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 17:09:26,420 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:26,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:26,420 INFO L82 PathProgramCache]: Analyzing trace with hash 421179102, now seen corresponding path program 1 times [2019-12-07 17:09:26,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:26,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721881216] [2019-12-07 17:09:26,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:26,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 17:09:26,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721881216] [2019-12-07 17:09:26,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:26,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:26,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141587657] [2019-12-07 17:09:26,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:26,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:26,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:26,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:26,433 INFO L87 Difference]: Start difference. First operand 14340 states and 17154 transitions. Second operand 3 states. [2019-12-07 17:09:26,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:26,516 INFO L93 Difference]: Finished difference Result 21512 states and 25604 transitions. [2019-12-07 17:09:26,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:26,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 17:09:26,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:26,530 INFO L225 Difference]: With dead ends: 21512 [2019-12-07 17:09:26,530 INFO L226 Difference]: Without dead ends: 14598 [2019-12-07 17:09:26,538 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 17:09:26,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14598 states. [2019-12-07 17:09:26,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14598 to 14596. [2019-12-07 17:09:26,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14596 states. [2019-12-07 17:09:26,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14596 states to 14596 states and 17154 transitions. [2019-12-07 17:09:26,693 INFO L78 Accepts]: Start accepts. Automaton has 14596 states and 17154 transitions. Word has length 25 [2019-12-07 17:09:26,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:26,693 INFO L462 AbstractCegarLoop]: Abstraction has 14596 states and 17154 transitions. [2019-12-07 17:09:26,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:26,694 INFO L276 IsEmpty]: Start isEmpty. Operand 14596 states and 17154 transitions. [2019-12-07 17:09:26,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:09:26,702 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:26,702 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 17:09:26,702 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:26,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:26,703 INFO L82 PathProgramCache]: Analyzing trace with hash -589938148, now seen corresponding path program 1 times [2019-12-07 17:09:26,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:26,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519097114] [2019-12-07 17:09:26,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:26,712 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 17:09:26,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519097114] [2019-12-07 17:09:26,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:26,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:26,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782998419] [2019-12-07 17:09:26,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:26,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:26,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:26,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:26,713 INFO L87 Difference]: Start difference. First operand 14596 states and 17154 transitions. Second operand 3 states. [2019-12-07 17:09:26,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:26,844 INFO L93 Difference]: Finished difference Result 23558 states and 27395 transitions. [2019-12-07 17:09:26,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:26,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 17:09:26,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:26,867 INFO L225 Difference]: With dead ends: 23558 [2019-12-07 17:09:26,867 INFO L226 Difference]: Without dead ends: 23556 [2019-12-07 17:09:26,871 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 17:09:26,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23556 states. [2019-12-07 17:09:27,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23556 to 22532. [2019-12-07 17:09:27,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22532 states. [2019-12-07 17:09:27,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22532 states to 22532 states and 25858 transitions. [2019-12-07 17:09:27,131 INFO L78 Accepts]: Start accepts. Automaton has 22532 states and 25858 transitions. Word has length 25 [2019-12-07 17:09:27,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:27,131 INFO L462 AbstractCegarLoop]: Abstraction has 22532 states and 25858 transitions. [2019-12-07 17:09:27,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:27,131 INFO L276 IsEmpty]: Start isEmpty. Operand 22532 states and 25858 transitions. [2019-12-07 17:09:27,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:09:27,146 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:27,147 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 17:09:27,147 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:27,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:27,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1176744162, now seen corresponding path program 1 times [2019-12-07 17:09:27,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:27,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996357651] [2019-12-07 17:09:27,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:27,157 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 17:09:27,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996357651] [2019-12-07 17:09:27,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:27,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:09:27,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933136662] [2019-12-07 17:09:27,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:09:27,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:27,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:09:27,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:09:27,158 INFO L87 Difference]: Start difference. First operand 22532 states and 25858 transitions. Second operand 3 states. [2019-12-07 17:09:27,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:27,330 INFO L93 Difference]: Finished difference Result 50180 states and 56578 transitions. [2019-12-07 17:09:27,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:09:27,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 17:09:27,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:27,331 INFO L225 Difference]: With dead ends: 50180 [2019-12-07 17:09:27,331 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 17:09:27,352 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 17:09:27,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 17:09:27,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 17:09:27,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 17:09:27,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 17:09:27,353 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-12-07 17:09:27,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:27,353 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:09:27,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:09:27,353 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 17:09:27,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 17:09:27,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 17:09:27,368 INFO L249 CegarLoopResult]: At program point L159(lines 5 163) the Hoare annotation is: true [2019-12-07 17:09:27,368 INFO L246 CegarLoopResult]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2019-12-07 17:09:27,368 INFO L246 CegarLoopResult]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2019-12-07 17:09:27,368 INFO L246 CegarLoopResult]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2019-12-07 17:09:27,368 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 17:09:27,368 INFO L246 CegarLoopResult]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2019-12-07 17:09:27,368 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 17:09:27,369 INFO L246 CegarLoopResult]: For program point L119(line 119) no Hoare annotation was computed. [2019-12-07 17:09:27,369 INFO L246 CegarLoopResult]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2019-12-07 17:09:27,369 INFO L246 CegarLoopResult]: For program point L144(line 144) no Hoare annotation was computed. [2019-12-07 17:09:27,369 INFO L246 CegarLoopResult]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2019-12-07 17:09:27,369 INFO L246 CegarLoopResult]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2019-12-07 17:09:27,369 INFO L246 CegarLoopResult]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2019-12-07 17:09:27,369 INFO L249 CegarLoopResult]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2019-12-07 17:09:27,369 INFO L249 CegarLoopResult]: At program point L162(lines 4 163) the Hoare annotation is: true [2019-12-07 17:09:27,369 INFO L246 CegarLoopResult]: For program point L129(line 129) no Hoare annotation was computed. [2019-12-07 17:09:27,369 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-12-07 17:09:27,369 INFO L242 CegarLoopResult]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2019-12-07 17:09:27,370 INFO L246 CegarLoopResult]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2019-12-07 17:09:27,370 INFO L246 CegarLoopResult]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2019-12-07 17:09:27,370 INFO L246 CegarLoopResult]: For program point L114(line 114) no Hoare annotation was computed. [2019-12-07 17:09:27,370 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-12-07 17:09:27,370 INFO L246 CegarLoopResult]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2019-12-07 17:09:27,370 INFO L246 CegarLoopResult]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2019-12-07 17:09:27,370 INFO L246 CegarLoopResult]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2019-12-07 17:09:27,370 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2019-12-07 17:09:27,370 INFO L246 CegarLoopResult]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2019-12-07 17:09:27,371 INFO L246 CegarLoopResult]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2019-12-07 17:09:27,371 INFO L246 CegarLoopResult]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-12-07 17:09:27,371 INFO L246 CegarLoopResult]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2019-12-07 17:09:27,371 INFO L246 CegarLoopResult]: For program point L66(lines 66 68) no Hoare annotation was computed. [2019-12-07 17:09:27,371 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 17:09:27,371 INFO L246 CegarLoopResult]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2019-12-07 17:09:27,371 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-12-07 17:09:27,371 INFO L246 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2019-12-07 17:09:27,371 INFO L246 CegarLoopResult]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2019-12-07 17:09:27,371 INFO L246 CegarLoopResult]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2019-12-07 17:09:27,371 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-12-07 17:09:27,372 INFO L246 CegarLoopResult]: For program point L134(line 134) no Hoare annotation was computed. [2019-12-07 17:09:27,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:09:27 BoogieIcfgContainer [2019-12-07 17:09:27,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:09:27,382 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:09:27,382 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:09:27,383 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:09:27,383 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:09:23" (3/4) ... [2019-12-07 17:09:27,386 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 17:09:27,398 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 17:09:27,398 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 17:09:27,443 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_493fc637-e4f2-4fe2-88c1-0903eb90299e/bin/uautomizer/witness.graphml [2019-12-07 17:09:27,443 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:09:27,444 INFO L168 Benchmark]: Toolchain (without parser) took 4520.16 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 249.6 MB). Free memory was 944.7 MB in the beginning and 812.6 MB in the end (delta: 132.1 MB). Peak memory consumption was 381.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:09:27,444 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:09:27,445 INFO L168 Benchmark]: CACSL2BoogieTranslator took 207.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -142.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:09:27,445 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.73 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 17:09:27,445 INFO L168 Benchmark]: Boogie Preprocessor took 15.34 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 17:09:27,446 INFO L168 Benchmark]: RCFGBuilder took 206.66 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:09:27,446 INFO L168 Benchmark]: TraceAbstraction took 4003.20 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 156.8 MB). Free memory was 1.1 GB in the beginning and 815.4 MB in the end (delta: 244.5 MB). Peak memory consumption was 401.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:09:27,446 INFO L168 Benchmark]: Witness Printer took 60.46 ms. Allocated memory is still 1.3 GB. Free memory was 815.4 MB in the beginning and 812.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:09:27,448 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 207.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -142.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.73 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 15.34 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. * RCFGBuilder took 206.66 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4003.20 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 156.8 MB). Free memory was 1.1 GB in the beginning and 815.4 MB in the end (delta: 244.5 MB). Peak memory consumption was 401.2 MB. Max. memory is 11.5 GB. * Witness Printer took 60.46 ms. Allocated memory is still 1.3 GB. Free memory was 815.4 MB in the beginning and 812.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 39 locations, 1 error locations. Result: SAFE, OverallTime: 3.9s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2276 SDtfs, 1149 SDslu, 1505 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22532occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 1033 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.2s InterpolantComputationTime, 580 NumberOfCodeBlocks, 580 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 552 ConstructedInterpolants, 0 QuantifiedInterpolants, 24156 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...