./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a704e44e-d050-4109-8211-fe6e13057473/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a704e44e-d050-4109-8211-fe6e13057473/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a704e44e-d050-4109-8211-fe6e13057473/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a704e44e-d050-4109-8211-fe6e13057473/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a704e44e-d050-4109-8211-fe6e13057473/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a704e44e-d050-4109-8211-fe6e13057473/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 e55536c26dc3d2371d51cd4bd073d4d19c2d7077 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:45:14,421 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:45:14,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:45:14,436 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:45:14,436 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:45:14,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:45:14,439 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:45:14,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:45:14,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:45:14,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:45:14,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:45:14,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:45:14,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:45:14,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:45:14,456 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:45:14,457 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:45:14,458 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:45:14,459 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:45:14,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:45:14,462 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:45:14,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:45:14,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:45:14,466 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:45:14,467 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:45:14,469 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:45:14,469 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:45:14,469 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:45:14,470 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:45:14,471 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:45:14,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:45:14,472 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:45:14,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:45:14,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:45:14,473 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:45:14,474 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:45:14,474 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:45:14,475 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:45:14,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:45:14,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:45:14,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:45:14,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:45:14,477 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a704e44e-d050-4109-8211-fe6e13057473/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:45:14,491 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:45:14,491 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:45:14,492 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:45:14,492 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:45:14,492 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:45:14,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:45:14,493 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:45:14,493 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:45:14,493 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:45:14,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:45:14,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:45:14,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:45:14,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:45:14,494 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:45:14,494 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:45:14,495 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:45:14,495 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:45:14,495 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:45:14,495 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:45:14,495 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:45:14,496 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:45:14,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:45:14,496 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:45:14,496 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:45:14,497 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:45:14,497 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:45:14,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:45:14,497 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:45:14,497 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_a704e44e-d050-4109-8211-fe6e13057473/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 -> e55536c26dc3d2371d51cd4bd073d4d19c2d7077 [2019-11-15 20:45:14,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:45:14,532 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:45:14,535 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:45:14,537 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:45:14,537 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:45:14,538 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a704e44e-d050-4109-8211-fe6e13057473/bin/uautomizer/../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-11-15 20:45:14,596 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a704e44e-d050-4109-8211-fe6e13057473/bin/uautomizer/data/f2f116a72/7168f665eed841ec973628ef130b15e3/FLAGd446a739c [2019-11-15 20:45:15,003 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:45:15,004 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a704e44e-d050-4109-8211-fe6e13057473/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-11-15 20:45:15,011 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a704e44e-d050-4109-8211-fe6e13057473/bin/uautomizer/data/f2f116a72/7168f665eed841ec973628ef130b15e3/FLAGd446a739c [2019-11-15 20:45:15,414 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a704e44e-d050-4109-8211-fe6e13057473/bin/uautomizer/data/f2f116a72/7168f665eed841ec973628ef130b15e3 [2019-11-15 20:45:15,416 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:45:15,417 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:45:15,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:45:15,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:45:15,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:45:15,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:45:15" (1/1) ... [2019-11-15 20:45:15,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28d32d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:45:15, skipping insertion in model container [2019-11-15 20:45:15,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:45:15" (1/1) ... [2019-11-15 20:45:15,431 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:45:15,458 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:45:15,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:45:15,704 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:45:15,752 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:45:15,769 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:45:15,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:45:15 WrapperNode [2019-11-15 20:45:15,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:45:15,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:45:15,771 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:45:15,771 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:45:15,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:45:15" (1/1) ... [2019-11-15 20:45:15,784 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:45:15" (1/1) ... [2019-11-15 20:45:15,817 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:45:15,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:45:15,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:45:15,817 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:45:15,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:45:15" (1/1) ... [2019-11-15 20:45:15,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:45:15" (1/1) ... [2019-11-15 20:45:15,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:45:15" (1/1) ... [2019-11-15 20:45:15,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:45:15" (1/1) ... [2019-11-15 20:45:15,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:45:15" (1/1) ... [2019-11-15 20:45:15,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:45:15" (1/1) ... [2019-11-15 20:45:15,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:45:15" (1/1) ... [2019-11-15 20:45:15,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:45:15,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:45:15,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:45:15,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:45:15,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:45:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a704e44e-d050-4109-8211-fe6e13057473/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-11-15 20:45:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:45:15,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:45:16,331 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:45:16,331 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 20:45:16,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:45:16 BoogieIcfgContainer [2019-11-15 20:45:16,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:45:16,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:45:16,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:45:16,337 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:45:16,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:45:15" (1/3) ... [2019-11-15 20:45:16,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397be9f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:45:16, skipping insertion in model container [2019-11-15 20:45:16,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:45:15" (2/3) ... [2019-11-15 20:45:16,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397be9f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:45:16, skipping insertion in model container [2019-11-15 20:45:16,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:45:16" (3/3) ... [2019-11-15 20:45:16,340 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2019-11-15 20:45:16,353 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:45:16,364 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-11-15 20:45:16,375 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-11-15 20:45:16,411 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:45:16,411 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:45:16,412 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:45:16,412 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:45:16,412 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:45:16,412 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:45:16,412 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:45:16,414 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:45:16,439 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2019-11-15 20:45:16,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 20:45:16,444 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:16,445 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:16,447 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:16,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:16,451 INFO L82 PathProgramCache]: Analyzing trace with hash -2034435078, now seen corresponding path program 1 times [2019-11-15 20:45:16,456 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:16,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250540879] [2019-11-15 20:45:16,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:16,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:16,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:16,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:16,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250540879] [2019-11-15 20:45:16,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:16,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:45:16,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673783446] [2019-11-15 20:45:16,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:45:16,592 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:16,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:45:16,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:45:16,607 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2019-11-15 20:45:16,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:16,638 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2019-11-15 20:45:16,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:45:16,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-15 20:45:16,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:16,649 INFO L225 Difference]: With dead ends: 88 [2019-11-15 20:45:16,649 INFO L226 Difference]: Without dead ends: 76 [2019-11-15 20:45:16,652 INFO L600 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-11-15 20:45:16,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-15 20:45:16,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-11-15 20:45:16,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-15 20:45:16,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-11-15 20:45:16,690 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 15 [2019-11-15 20:45:16,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:16,691 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-11-15 20:45:16,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:45:16,691 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-11-15 20:45:16,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 20:45:16,691 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:16,692 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:16,692 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:16,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:16,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1357026114, now seen corresponding path program 1 times [2019-11-15 20:45:16,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:16,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809958924] [2019-11-15 20:45:16,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:16,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:16,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:16,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:16,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809958924] [2019-11-15 20:45:16,757 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:16,757 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:45:16,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880060653] [2019-11-15 20:45:16,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:45:16,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:16,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:45:16,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:45:16,760 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2019-11-15 20:45:16,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:16,881 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-11-15 20:45:16,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:45:16,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-15 20:45:16,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:16,883 INFO L225 Difference]: With dead ends: 76 [2019-11-15 20:45:16,883 INFO L226 Difference]: Without dead ends: 74 [2019-11-15 20:45:16,884 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:45:16,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-15 20:45:16,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-15 20:45:16,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-15 20:45:16,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2019-11-15 20:45:16,893 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 16 [2019-11-15 20:45:16,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:16,893 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2019-11-15 20:45:16,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:45:16,893 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2019-11-15 20:45:16,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 20:45:16,894 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:16,894 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:16,895 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:16,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:16,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1567835227, now seen corresponding path program 1 times [2019-11-15 20:45:16,896 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:16,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747436563] [2019-11-15 20:45:16,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:16,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:16,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:16,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:16,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747436563] [2019-11-15 20:45:16,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:16,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:45:16,949 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632097182] [2019-11-15 20:45:16,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:45:16,950 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:16,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:45:16,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:45:16,950 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 4 states. [2019-11-15 20:45:17,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:17,046 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2019-11-15 20:45:17,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:45:17,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-15 20:45:17,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:17,050 INFO L225 Difference]: With dead ends: 97 [2019-11-15 20:45:17,050 INFO L226 Difference]: Without dead ends: 95 [2019-11-15 20:45:17,051 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:17,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-15 20:45:17,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 72. [2019-11-15 20:45:17,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-15 20:45:17,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2019-11-15 20:45:17,071 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 18 [2019-11-15 20:45:17,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:17,072 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2019-11-15 20:45:17,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:45:17,073 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2019-11-15 20:45:17,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 20:45:17,074 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:17,074 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:17,075 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:17,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:17,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1358247672, now seen corresponding path program 1 times [2019-11-15 20:45:17,076 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:17,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756172883] [2019-11-15 20:45:17,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:17,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:17,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:17,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:17,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756172883] [2019-11-15 20:45:17,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:17,169 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:45:17,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053507051] [2019-11-15 20:45:17,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:45:17,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:17,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:45:17,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:17,171 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 5 states. [2019-11-15 20:45:17,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:17,242 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2019-11-15 20:45:17,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:45:17,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-15 20:45:17,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:17,243 INFO L225 Difference]: With dead ends: 72 [2019-11-15 20:45:17,244 INFO L226 Difference]: Without dead ends: 70 [2019-11-15 20:45:17,244 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:17,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-15 20:45:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-15 20:45:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-15 20:45:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-11-15 20:45:17,251 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 19 [2019-11-15 20:45:17,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:17,251 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-11-15 20:45:17,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:45:17,252 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-11-15 20:45:17,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 20:45:17,252 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:17,253 INFO L380 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-11-15 20:45:17,253 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:17,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:17,253 INFO L82 PathProgramCache]: Analyzing trace with hash -665385716, now seen corresponding path program 1 times [2019-11-15 20:45:17,254 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:17,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944171567] [2019-11-15 20:45:17,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:17,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:17,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:17,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:17,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944171567] [2019-11-15 20:45:17,318 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:17,318 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:45:17,318 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566361653] [2019-11-15 20:45:17,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:45:17,319 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:17,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:45:17,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:17,319 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2019-11-15 20:45:17,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:17,528 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2019-11-15 20:45:17,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:45:17,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-15 20:45:17,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:17,531 INFO L225 Difference]: With dead ends: 137 [2019-11-15 20:45:17,531 INFO L226 Difference]: Without dead ends: 135 [2019-11-15 20:45:17,531 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:45:17,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-15 20:45:17,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 73. [2019-11-15 20:45:17,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-15 20:45:17,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2019-11-15 20:45:17,546 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 22 [2019-11-15 20:45:17,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:17,547 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2019-11-15 20:45:17,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:45:17,547 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2019-11-15 20:45:17,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 20:45:17,549 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:17,549 INFO L380 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-11-15 20:45:17,550 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:17,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:17,550 INFO L82 PathProgramCache]: Analyzing trace with hash -661217951, now seen corresponding path program 1 times [2019-11-15 20:45:17,550 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:17,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302663059] [2019-11-15 20:45:17,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:17,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:17,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:17,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:17,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302663059] [2019-11-15 20:45:17,654 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:17,654 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:45:17,654 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830673728] [2019-11-15 20:45:17,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:45:17,655 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:17,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:45:17,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:17,655 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2019-11-15 20:45:17,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:17,809 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2019-11-15 20:45:17,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:45:17,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-15 20:45:17,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:17,811 INFO L225 Difference]: With dead ends: 104 [2019-11-15 20:45:17,811 INFO L226 Difference]: Without dead ends: 102 [2019-11-15 20:45:17,812 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:45:17,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-15 20:45:17,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2019-11-15 20:45:17,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-15 20:45:17,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-11-15 20:45:17,819 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2019-11-15 20:45:17,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:17,820 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-11-15 20:45:17,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:45:17,820 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-11-15 20:45:17,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 20:45:17,821 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:17,821 INFO L380 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-11-15 20:45:17,822 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:17,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:17,822 INFO L82 PathProgramCache]: Analyzing trace with hash 847883539, now seen corresponding path program 1 times [2019-11-15 20:45:17,822 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:17,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340007030] [2019-11-15 20:45:17,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:17,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:17,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:17,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:17,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340007030] [2019-11-15 20:45:17,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:17,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:45:17,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662296067] [2019-11-15 20:45:17,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:45:17,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:17,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:45:17,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:17,897 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2019-11-15 20:45:18,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:18,039 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2019-11-15 20:45:18,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:45:18,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-15 20:45:18,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:18,041 INFO L225 Difference]: With dead ends: 117 [2019-11-15 20:45:18,041 INFO L226 Difference]: Without dead ends: 115 [2019-11-15 20:45:18,042 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:18,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-15 20:45:18,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 73. [2019-11-15 20:45:18,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-15 20:45:18,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2019-11-15 20:45:18,054 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 23 [2019-11-15 20:45:18,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:18,056 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2019-11-15 20:45:18,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:45:18,056 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2019-11-15 20:45:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 20:45:18,057 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:18,057 INFO L380 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-11-15 20:45:18,058 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:18,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:18,058 INFO L82 PathProgramCache]: Analyzing trace with hash 977084131, now seen corresponding path program 1 times [2019-11-15 20:45:18,059 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:18,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145298662] [2019-11-15 20:45:18,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:18,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:18,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:18,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:18,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145298662] [2019-11-15 20:45:18,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:18,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:45:18,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306678740] [2019-11-15 20:45:18,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:45:18,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:18,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:45:18,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:18,142 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2019-11-15 20:45:18,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:18,248 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2019-11-15 20:45:18,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:45:18,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-15 20:45:18,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:18,250 INFO L225 Difference]: With dead ends: 73 [2019-11-15 20:45:18,250 INFO L226 Difference]: Without dead ends: 71 [2019-11-15 20:45:18,250 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-15 20:45:18,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-15 20:45:18,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-15 20:45:18,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2019-11-15 20:45:18,256 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 23 [2019-11-15 20:45:18,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:18,257 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2019-11-15 20:45:18,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:45:18,257 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2019-11-15 20:45:18,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 20:45:18,258 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:18,258 INFO L380 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-11-15 20:45:18,258 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:18,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:18,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1619855478, now seen corresponding path program 1 times [2019-11-15 20:45:18,259 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:18,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054249444] [2019-11-15 20:45:18,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:18,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:18,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:18,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:18,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054249444] [2019-11-15 20:45:18,311 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:18,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:45:18,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627418512] [2019-11-15 20:45:18,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:45:18,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:18,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:45:18,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:45:18,313 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 3 states. [2019-11-15 20:45:18,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:18,360 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2019-11-15 20:45:18,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:45:18,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-15 20:45:18,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:18,361 INFO L225 Difference]: With dead ends: 111 [2019-11-15 20:45:18,361 INFO L226 Difference]: Without dead ends: 71 [2019-11-15 20:45:18,362 INFO L600 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-11-15 20:45:18,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-15 20:45:18,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-15 20:45:18,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-15 20:45:18,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2019-11-15 20:45:18,367 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2019-11-15 20:45:18,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:18,368 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2019-11-15 20:45:18,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:45:18,368 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2019-11-15 20:45:18,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 20:45:18,369 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:18,374 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:18,375 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:18,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:18,381 INFO L82 PathProgramCache]: Analyzing trace with hash 595608307, now seen corresponding path program 1 times [2019-11-15 20:45:18,381 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:18,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402068692] [2019-11-15 20:45:18,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:18,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:18,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:18,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 20:45:18,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402068692] [2019-11-15 20:45:18,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824955325] [2019-11-15 20:45:18,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a704e44e-d050-4109-8211-fe6e13057473/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:18,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 20:45:18,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:18,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:45:18,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 20:45:18,595 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:45:18,595 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2019-11-15 20:45:18,595 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888004728] [2019-11-15 20:45:18,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:45:18,596 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:18,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:45:18,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:18,596 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 7 states. [2019-11-15 20:45:18,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:18,729 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2019-11-15 20:45:18,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:45:18,729 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-15 20:45:18,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:18,730 INFO L225 Difference]: With dead ends: 111 [2019-11-15 20:45:18,730 INFO L226 Difference]: Without dead ends: 109 [2019-11-15 20:45:18,731 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:45:18,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-15 20:45:18,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 68. [2019-11-15 20:45:18,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-15 20:45:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-11-15 20:45:18,736 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2019-11-15 20:45:18,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:18,737 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-11-15 20:45:18,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:45:18,737 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-11-15 20:45:18,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 20:45:18,737 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:18,738 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:18,938 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:18,939 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:18,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:18,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1780382557, now seen corresponding path program 1 times [2019-11-15 20:45:18,939 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:18,939 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131879900] [2019-11-15 20:45:18,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:18,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:18,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:18,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:18,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131879900] [2019-11-15 20:45:18,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:18,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:45:18,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091419499] [2019-11-15 20:45:18,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:45:18,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:18,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:45:18,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:18,979 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 5 states. [2019-11-15 20:45:19,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:19,057 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-11-15 20:45:19,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:45:19,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-15 20:45:19,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:19,059 INFO L225 Difference]: With dead ends: 69 [2019-11-15 20:45:19,059 INFO L226 Difference]: Without dead ends: 67 [2019-11-15 20:45:19,059 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:19,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-15 20:45:19,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-11-15 20:45:19,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-15 20:45:19,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2019-11-15 20:45:19,064 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2019-11-15 20:45:19,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:19,065 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2019-11-15 20:45:19,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:45:19,065 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2019-11-15 20:45:19,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 20:45:19,066 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:19,066 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 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-11-15 20:45:19,067 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:19,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:19,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1280139623, now seen corresponding path program 1 times [2019-11-15 20:45:19,067 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:19,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024381949] [2019-11-15 20:45:19,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:19,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:19,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:19,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 20:45:19,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024381949] [2019-11-15 20:45:19,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808738447] [2019-11-15 20:45:19,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a704e44e-d050-4109-8211-fe6e13057473/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:19,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 20:45:19,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:19,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:45:19,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 20:45:19,216 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:45:19,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2019-11-15 20:45:19,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530551600] [2019-11-15 20:45:19,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:45:19,217 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:19,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:45:19,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:19,218 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 7 states. [2019-11-15 20:45:19,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:19,322 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-11-15 20:45:19,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:45:19,322 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-15 20:45:19,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:19,323 INFO L225 Difference]: With dead ends: 67 [2019-11-15 20:45:19,323 INFO L226 Difference]: Without dead ends: 65 [2019-11-15 20:45:19,324 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:45:19,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-15 20:45:19,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2019-11-15 20:45:19,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-15 20:45:19,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-11-15 20:45:19,349 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 27 [2019-11-15 20:45:19,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:19,350 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-11-15 20:45:19,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:45:19,350 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-11-15 20:45:19,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 20:45:19,354 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:19,355 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:19,558 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:19,559 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:19,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:19,560 INFO L82 PathProgramCache]: Analyzing trace with hash -642711428, now seen corresponding path program 1 times [2019-11-15 20:45:19,560 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:19,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204049796] [2019-11-15 20:45:19,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:19,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:19,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:19,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:19,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204049796] [2019-11-15 20:45:19,596 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:19,596 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:45:19,596 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842181871] [2019-11-15 20:45:19,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:45:19,596 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:19,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:45:19,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:19,597 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 5 states. [2019-11-15 20:45:19,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:19,650 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-11-15 20:45:19,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:45:19,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-15 20:45:19,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:19,651 INFO L225 Difference]: With dead ends: 60 [2019-11-15 20:45:19,651 INFO L226 Difference]: Without dead ends: 58 [2019-11-15 20:45:19,652 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:19,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-15 20:45:19,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-15 20:45:19,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-15 20:45:19,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-11-15 20:45:19,655 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 27 [2019-11-15 20:45:19,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:19,656 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-11-15 20:45:19,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:45:19,656 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-11-15 20:45:19,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 20:45:19,657 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:19,657 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:19,657 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:19,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:19,658 INFO L82 PathProgramCache]: Analyzing trace with hash -47880409, now seen corresponding path program 1 times [2019-11-15 20:45:19,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:19,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635314595] [2019-11-15 20:45:19,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:19,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:19,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:19,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:19,721 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635314595] [2019-11-15 20:45:19,721 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:19,721 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:45:19,722 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575531478] [2019-11-15 20:45:19,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:45:19,722 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:19,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:45:19,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:19,723 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2019-11-15 20:45:19,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:19,789 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-11-15 20:45:19,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:45:19,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-15 20:45:19,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:19,790 INFO L225 Difference]: With dead ends: 59 [2019-11-15 20:45:19,790 INFO L226 Difference]: Without dead ends: 57 [2019-11-15 20:45:19,791 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:19,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-15 20:45:19,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-11-15 20:45:19,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-15 20:45:19,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-11-15 20:45:19,794 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 30 [2019-11-15 20:45:19,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:19,794 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-11-15 20:45:19,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:45:19,794 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-11-15 20:45:19,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 20:45:19,795 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:19,795 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:19,796 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:19,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:19,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1484288504, now seen corresponding path program 1 times [2019-11-15 20:45:19,796 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:19,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425096852] [2019-11-15 20:45:19,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:19,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:19,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:19,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:19,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425096852] [2019-11-15 20:45:19,842 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:19,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:45:19,842 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718786205] [2019-11-15 20:45:19,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:45:19,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:19,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:45:19,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:45:19,843 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 6 states. [2019-11-15 20:45:19,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:19,945 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-11-15 20:45:19,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:45:19,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-11-15 20:45:19,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:19,946 INFO L225 Difference]: With dead ends: 67 [2019-11-15 20:45:19,946 INFO L226 Difference]: Without dead ends: 65 [2019-11-15 20:45:19,947 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:45:19,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-15 20:45:19,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2019-11-15 20:45:19,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-15 20:45:19,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2019-11-15 20:45:19,950 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 31 [2019-11-15 20:45:19,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:19,950 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2019-11-15 20:45:19,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:45:19,950 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2019-11-15 20:45:19,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 20:45:19,951 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:19,951 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:19,951 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:19,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:19,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1746453711, now seen corresponding path program 1 times [2019-11-15 20:45:19,952 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:19,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803808971] [2019-11-15 20:45:19,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:19,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:19,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:19,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:19,994 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803808971] [2019-11-15 20:45:19,994 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:19,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:45:19,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336992176] [2019-11-15 20:45:19,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:45:19,994 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:19,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:45:19,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:19,995 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 5 states. [2019-11-15 20:45:20,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:20,115 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2019-11-15 20:45:20,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:45:20,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-15 20:45:20,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:20,116 INFO L225 Difference]: With dead ends: 87 [2019-11-15 20:45:20,117 INFO L226 Difference]: Without dead ends: 85 [2019-11-15 20:45:20,117 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:20,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-15 20:45:20,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2019-11-15 20:45:20,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-15 20:45:20,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-11-15 20:45:20,121 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 34 [2019-11-15 20:45:20,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:20,122 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-11-15 20:45:20,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:45:20,122 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-11-15 20:45:20,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 20:45:20,122 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:20,123 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:20,123 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:20,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:20,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1694514003, now seen corresponding path program 1 times [2019-11-15 20:45:20,124 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:20,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190904831] [2019-11-15 20:45:20,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:20,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:20,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:20,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:20,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190904831] [2019-11-15 20:45:20,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:20,169 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:45:20,169 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934844409] [2019-11-15 20:45:20,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:45:20,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:20,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:45:20,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:20,170 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 5 states. [2019-11-15 20:45:20,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:20,244 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-11-15 20:45:20,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:45:20,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-15 20:45:20,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:20,245 INFO L225 Difference]: With dead ends: 57 [2019-11-15 20:45:20,245 INFO L226 Difference]: Without dead ends: 55 [2019-11-15 20:45:20,245 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:20,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-15 20:45:20,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-11-15 20:45:20,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-15 20:45:20,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2019-11-15 20:45:20,249 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 35 [2019-11-15 20:45:20,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:20,249 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2019-11-15 20:45:20,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:45:20,249 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2019-11-15 20:45:20,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 20:45:20,250 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:20,250 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:20,250 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:20,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:20,250 INFO L82 PathProgramCache]: Analyzing trace with hash 635482230, now seen corresponding path program 1 times [2019-11-15 20:45:20,251 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:20,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256762630] [2019-11-15 20:45:20,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:20,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:20,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:20,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:20,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256762630] [2019-11-15 20:45:20,303 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:20,303 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:45:20,303 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371189634] [2019-11-15 20:45:20,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:45:20,304 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:20,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:45:20,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:20,304 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 5 states. [2019-11-15 20:45:20,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:20,325 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-11-15 20:45:20,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:45:20,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-11-15 20:45:20,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:20,326 INFO L225 Difference]: With dead ends: 66 [2019-11-15 20:45:20,326 INFO L226 Difference]: Without dead ends: 64 [2019-11-15 20:45:20,327 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:20,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-15 20:45:20,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-11-15 20:45:20,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-15 20:45:20,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-11-15 20:45:20,331 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 37 [2019-11-15 20:45:20,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:20,332 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-11-15 20:45:20,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:45:20,332 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-11-15 20:45:20,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 20:45:20,332 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:20,332 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:20,333 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:20,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:20,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1774883137, now seen corresponding path program 1 times [2019-11-15 20:45:20,333 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:20,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738825650] [2019-11-15 20:45:20,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:20,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:20,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:20,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:20,400 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738825650] [2019-11-15 20:45:20,400 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:20,400 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:45:20,400 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295200752] [2019-11-15 20:45:20,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:45:20,401 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:20,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:45:20,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:20,401 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 5 states. [2019-11-15 20:45:20,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:20,431 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-11-15 20:45:20,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:45:20,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-11-15 20:45:20,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:20,433 INFO L225 Difference]: With dead ends: 64 [2019-11-15 20:45:20,433 INFO L226 Difference]: Without dead ends: 62 [2019-11-15 20:45:20,433 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:45:20,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-15 20:45:20,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-11-15 20:45:20,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-15 20:45:20,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-11-15 20:45:20,438 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 38 [2019-11-15 20:45:20,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:20,438 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-11-15 20:45:20,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:45:20,438 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-11-15 20:45:20,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 20:45:20,438 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:20,439 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:20,439 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:20,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:20,439 INFO L82 PathProgramCache]: Analyzing trace with hash 813201821, now seen corresponding path program 1 times [2019-11-15 20:45:20,439 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:20,440 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559253901] [2019-11-15 20:45:20,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:20,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:20,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:20,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559253901] [2019-11-15 20:45:20,487 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:20,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:45:20,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440918164] [2019-11-15 20:45:20,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:45:20,488 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:20,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:45:20,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:20,489 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 5 states. [2019-11-15 20:45:20,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:20,619 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2019-11-15 20:45:20,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:45:20,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-11-15 20:45:20,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:20,621 INFO L225 Difference]: With dead ends: 86 [2019-11-15 20:45:20,621 INFO L226 Difference]: Without dead ends: 84 [2019-11-15 20:45:20,621 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:20,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-15 20:45:20,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 65. [2019-11-15 20:45:20,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-15 20:45:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2019-11-15 20:45:20,626 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 39 [2019-11-15 20:45:20,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:20,626 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2019-11-15 20:45:20,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:45:20,626 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2019-11-15 20:45:20,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 20:45:20,627 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:20,627 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:20,627 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:20,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:20,628 INFO L82 PathProgramCache]: Analyzing trace with hash -560543098, now seen corresponding path program 1 times [2019-11-15 20:45:20,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:20,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783185257] [2019-11-15 20:45:20,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:20,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:20,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:20,683 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783185257] [2019-11-15 20:45:20,683 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:20,683 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:45:20,683 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818033292] [2019-11-15 20:45:20,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:45:20,684 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:20,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:45:20,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:20,684 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 5 states. [2019-11-15 20:45:20,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:20,773 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-11-15 20:45:20,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:45:20,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-11-15 20:45:20,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:20,774 INFO L225 Difference]: With dead ends: 71 [2019-11-15 20:45:20,774 INFO L226 Difference]: Without dead ends: 69 [2019-11-15 20:45:20,775 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:20,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-15 20:45:20,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2019-11-15 20:45:20,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-15 20:45:20,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2019-11-15 20:45:20,779 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 40 [2019-11-15 20:45:20,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:20,779 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2019-11-15 20:45:20,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:45:20,779 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2019-11-15 20:45:20,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 20:45:20,780 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:20,780 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 20:45:20,786 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:20,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:20,787 INFO L82 PathProgramCache]: Analyzing trace with hash 375780089, now seen corresponding path program 1 times [2019-11-15 20:45:20,788 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:20,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514787022] [2019-11-15 20:45:20,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:20,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:20,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:20,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:20,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514787022] [2019-11-15 20:45:20,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148938782] [2019-11-15 20:45:20,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a704e44e-d050-4109-8211-fe6e13057473/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:20,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 20:45:20,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:20,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:45:20,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:20,977 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:45:20,977 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-15 20:45:20,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050817174] [2019-11-15 20:45:20,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:45:20,978 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:20,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:45:20,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:45:20,978 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 8 states. [2019-11-15 20:45:21,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:21,149 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-11-15 20:45:21,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:45:21,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-11-15 20:45:21,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:21,152 INFO L225 Difference]: With dead ends: 64 [2019-11-15 20:45:21,152 INFO L226 Difference]: Without dead ends: 62 [2019-11-15 20:45:21,152 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:45:21,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-15 20:45:21,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-11-15 20:45:21,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-15 20:45:21,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-11-15 20:45:21,157 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 40 [2019-11-15 20:45:21,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:21,157 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-11-15 20:45:21,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:45:21,157 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-11-15 20:45:21,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 20:45:21,158 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:21,158 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 20:45:21,361 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:21,361 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:21,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:21,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1394778411, now seen corresponding path program 1 times [2019-11-15 20:45:21,362 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:21,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21761239] [2019-11-15 20:45:21,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:21,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:21,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:21,431 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 20:45:21,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21761239] [2019-11-15 20:45:21,431 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:21,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:45:21,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151658926] [2019-11-15 20:45:21,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:45:21,432 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:21,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:45:21,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:45:21,433 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 5 states. [2019-11-15 20:45:21,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:21,554 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2019-11-15 20:45:21,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:45:21,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-15 20:45:21,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:21,556 INFO L225 Difference]: With dead ends: 73 [2019-11-15 20:45:21,556 INFO L226 Difference]: Without dead ends: 71 [2019-11-15 20:45:21,556 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:45:21,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-15 20:45:21,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2019-11-15 20:45:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-15 20:45:21,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2019-11-15 20:45:21,560 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 45 [2019-11-15 20:45:21,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:21,561 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2019-11-15 20:45:21,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:45:21,561 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2019-11-15 20:45:21,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 20:45:21,561 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:21,562 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 20:45:21,562 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:21,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:21,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1932282916, now seen corresponding path program 1 times [2019-11-15 20:45:21,562 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:21,562 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278954031] [2019-11-15 20:45:21,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:21,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:21,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:21,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:21,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278954031] [2019-11-15 20:45:21,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078224952] [2019-11-15 20:45:21,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a704e44e-d050-4109-8211-fe6e13057473/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:21,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 20:45:21,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:21,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:45:21,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 20:45:21,750 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:45:21,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2019-11-15 20:45:21,750 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110333436] [2019-11-15 20:45:21,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:45:21,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:21,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:45:21,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:45:21,751 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 4 states. [2019-11-15 20:45:21,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:21,785 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2019-11-15 20:45:21,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:45:21,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-15 20:45:21,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:21,786 INFO L225 Difference]: With dead ends: 56 [2019-11-15 20:45:21,786 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 20:45:21,787 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:21,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 20:45:21,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 20:45:21,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 20:45:21,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:45:21,787 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2019-11-15 20:45:21,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:21,788 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:45:21,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:45:21,788 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:45:21,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 20:45:21,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:21,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 20:45:22,318 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-11-15 20:45:22,869 WARN L191 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2019-11-15 20:45:23,155 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 36 [2019-11-15 20:45:23,531 WARN L191 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2019-11-15 20:45:23,535 INFO L443 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2019-11-15 20:45:23,535 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-15 20:45:23,535 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 398) no Hoare annotation was computed. [2019-11-15 20:45:23,535 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2019-11-15 20:45:23,536 INFO L443 ceAbstractionStarter]: For program point L267(line 267) no Hoare annotation was computed. [2019-11-15 20:45:23,536 INFO L443 ceAbstractionStarter]: For program point L36(lines 36 430) no Hoare annotation was computed. [2019-11-15 20:45:23,536 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 20:45:23,536 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-11-15 20:45:23,536 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-11-15 20:45:23,536 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 390) no Hoare annotation was computed. [2019-11-15 20:45:23,536 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 311) no Hoare annotation was computed. [2019-11-15 20:45:23,536 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 339) no Hoare annotation was computed. [2019-11-15 20:45:23,536 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-11-15 20:45:23,536 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 369) no Hoare annotation was computed. [2019-11-15 20:45:23,536 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-15 20:45:23,536 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 427) no Hoare annotation was computed. [2019-11-15 20:45:23,536 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 326) no Hoare annotation was computed. [2019-11-15 20:45:23,537 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 352) no Hoare annotation was computed. [2019-11-15 20:45:23,537 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-11-15 20:45:23,537 INFO L443 ceAbstractionStarter]: For program point L369(line 369) no Hoare annotation was computed. [2019-11-15 20:45:23,537 INFO L443 ceAbstractionStarter]: For program point L303(line 303) no Hoare annotation was computed. [2019-11-15 20:45:23,537 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 357) no Hoare annotation was computed. [2019-11-15 20:45:23,537 INFO L443 ceAbstractionStarter]: For program point L221(line 221) no Hoare annotation was computed. [2019-11-15 20:45:23,537 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 422) no Hoare annotation was computed. [2019-11-15 20:45:23,537 INFO L443 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2019-11-15 20:45:23,537 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-15 20:45:23,537 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 400) no Hoare annotation was computed. [2019-11-15 20:45:23,538 INFO L439 ceAbstractionStarter]: At program point L387(lines 124 398) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0) (let ((.cse0 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse1 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse2 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) (.cse3 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3))) (or (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~2) .cse0 .cse1 .cse2 .cse3) (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2)) .cse0 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~17)) .cse1 .cse2 .cse3 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~16))))) [2019-11-15 20:45:23,538 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 349) no Hoare annotation was computed. [2019-11-15 20:45:23,538 INFO L443 ceAbstractionStarter]: For program point L90(lines 90 407) no Hoare annotation was computed. [2019-11-15 20:45:23,538 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 432) no Hoare annotation was computed. [2019-11-15 20:45:23,538 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 303) no Hoare annotation was computed. [2019-11-15 20:45:23,538 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 238) no Hoare annotation was computed. [2019-11-15 20:45:23,538 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-11-15 20:45:23,538 INFO L439 ceAbstractionStarter]: At program point L322(lines 257 323) the Hoare annotation is: (let ((.cse2 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~6))) (.cse3 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~5))) (.cse0 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~10)) (.cse4 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~7))) (.cse5 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~4)) (.cse6 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~8))) (.cse7 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2))) (.cse8 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse9 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~11))) (.cse10 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse11 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) (.cse12 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3)) (.cse13 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (.cse1 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~9)) (.cse14 (< (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0))) (or (and .cse0 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~12) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~15)) .cse1 (and .cse2 .cse3 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~13)) (<= 1 ULTIMATE.start_main_~main__c~0) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~14)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)) (and .cse2 .cse3 .cse0 (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse1 .cse14 (= ULTIMATE.start_main_~main__c~0 0)))) [2019-11-15 20:45:23,538 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 313) no Hoare annotation was computed. [2019-11-15 20:45:23,538 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 20:45:23,538 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 354) no Hoare annotation was computed. [2019-11-15 20:45:23,538 INFO L443 ceAbstractionStarter]: For program point L58(lines 58 417) no Hoare annotation was computed. [2019-11-15 20:45:23,538 INFO L439 ceAbstractionStarter]: At program point L405(lines 99 406) the Hoare annotation is: (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) [2019-11-15 20:45:23,539 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 221) no Hoare annotation was computed. [2019-11-15 20:45:23,539 INFO L443 ceAbstractionStarter]: For program point L207(lines 207 341) no Hoare annotation was computed. [2019-11-15 20:45:23,539 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-15 20:45:23,539 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 429) no Hoare annotation was computed. [2019-11-15 20:45:23,539 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 323) no Hoare annotation was computed. [2019-11-15 20:45:23,539 INFO L443 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-11-15 20:45:23,539 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-11-15 20:45:23,539 INFO L443 ceAbstractionStarter]: For program point L291(line 291) no Hoare annotation was computed. [2019-11-15 20:45:23,539 INFO L443 ceAbstractionStarter]: For program point L60(lines 60 412) no Hoare annotation was computed. [2019-11-15 20:45:23,539 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 291) no Hoare annotation was computed. [2019-11-15 20:45:23,539 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2019-11-15 20:45:23,539 INFO L443 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2019-11-15 20:45:23,539 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 20:45:23,540 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 409) no Hoare annotation was computed. [2019-11-15 20:45:23,540 INFO L439 ceAbstractionStarter]: At program point L310(lines 225 339) the Hoare annotation is: (let ((.cse0 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~10)) (.cse3 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~11))) (.cse2 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse1 (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~8)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~7)) (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~4) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~6)) (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~5)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2)) (< 0 ULTIMATE.start_main_~main__scheme~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1)) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3) (<= (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0))))) (.cse4 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~9)) (.cse5 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (.cse6 (= ULTIMATE.start_main_~main__c~0 0))) (or (and .cse0 (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~12) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~13)) (<= 1 ULTIMATE.start_main_~main__c~0) .cse1 .cse2 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~14)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~15)) .cse3 .cse4 .cse5) (and .cse2 (<= (+ ULTIMATE.start_main_~main__cp~0 2) ULTIMATE.start_main_~main__urilen~0) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~8) .cse1 .cse4 .cse5 .cse6))) [2019-11-15 20:45:23,540 INFO L443 ceAbstractionStarter]: For program point L277(lines 277 315) no Hoare annotation was computed. [2019-11-15 20:45:23,540 INFO L446 ceAbstractionStarter]: At program point L426(lines 8 434) the Hoare annotation is: true [2019-11-15 20:45:23,540 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 431) no Hoare annotation was computed. [2019-11-15 20:45:23,540 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 209) no Hoare annotation was computed. [2019-11-15 20:45:23,540 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2019-11-15 20:45:23,540 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-15 20:45:23,540 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 333) no Hoare annotation was computed. [2019-11-15 20:45:23,540 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 392) no Hoare annotation was computed. [2019-11-15 20:45:23,540 INFO L443 ceAbstractionStarter]: For program point L279(line 279) no Hoare annotation was computed. [2019-11-15 20:45:23,540 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-11-15 20:45:23,540 INFO L443 ceAbstractionStarter]: For program point L48(lines 48 428) no Hoare annotation was computed. [2019-11-15 20:45:23,541 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 20:45:23,541 INFO L443 ceAbstractionStarter]: For program point L379(lines 379 388) no Hoare annotation was computed. [2019-11-15 20:45:23,541 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2019-11-15 20:45:23,541 INFO L439 ceAbstractionStarter]: At program point L396(lines 126 397) the Hoare annotation is: (let ((.cse0 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3)) (.cse1 (and (< ULTIMATE.start_main_~main__cp~0 ULTIMATE.start_main_~main__urilen~0) (let ((.cse2 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse3 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0))) (.cse4 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse5 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~3))) (.cse6 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1)))) (or (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~2) .cse2 .cse3 .cse4 .cse5 .cse6) (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~16)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2)) .cse2 .cse3 .cse4 .cse5 .cse6)))))) (or (and (and .cse0 .cse1) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (and (= (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) .cse0 .cse1))) [2019-11-15 20:45:23,541 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 406) no Hoare annotation was computed. [2019-11-15 20:45:23,541 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 411) no Hoare annotation was computed. [2019-11-15 20:45:23,541 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 92) no Hoare annotation was computed. [2019-11-15 20:45:23,541 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 324) no Hoare annotation was computed. [2019-11-15 20:45:23,541 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 350) no Hoare annotation was computed. [2019-11-15 20:45:23,541 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 317) no Hoare annotation was computed. [2019-11-15 20:45:23,541 INFO L443 ceAbstractionStarter]: For program point L199(lines 199 348) no Hoare annotation was computed. [2019-11-15 20:45:23,542 INFO L443 ceAbstractionStarter]: For program point L381(line 381) no Hoare annotation was computed. [2019-11-15 20:45:23,542 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 381) no Hoare annotation was computed. [2019-11-15 20:45:23,542 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 355) no Hoare annotation was computed. [2019-11-15 20:45:23,542 INFO L443 ceAbstractionStarter]: For program point L18(lines 18 433) no Hoare annotation was computed. [2019-11-15 20:45:23,542 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2019-11-15 20:45:23,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:45:23 BoogieIcfgContainer [2019-11-15 20:45:23,575 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:45:23,576 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:45:23,589 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:45:23,589 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:45:23,589 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:45:16" (3/4) ... [2019-11-15 20:45:23,592 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 20:45:23,603 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-15 20:45:23,604 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 20:45:23,675 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a704e44e-d050-4109-8211-fe6e13057473/bin/uautomizer/witness.graphml [2019-11-15 20:45:23,675 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:45:23,676 INFO L168 Benchmark]: Toolchain (without parser) took 8259.07 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 288.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 126.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:45:23,676 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:45:23,677 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -158.6 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:45:23,677 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.85 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-11-15 20:45:23,677 INFO L168 Benchmark]: Boogie Preprocessor took 24.03 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:45:23,678 INFO L168 Benchmark]: RCFGBuilder took 492.09 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:45:23,678 INFO L168 Benchmark]: TraceAbstraction took 7241.31 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -51.7 MB). Peak memory consumption was 388.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:45:23,679 INFO L168 Benchmark]: Witness Printer took 99.10 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 11.5 GB. [2019-11-15 20:45:23,681 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 352.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -158.6 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.85 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 24.03 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 492.09 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7241.31 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -51.7 MB). Peak memory consumption was 388.2 MB. Max. memory is 11.5 GB. * Witness Printer took 99.10 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 221]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 209]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 381]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 303]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 369]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 291]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 238]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 267]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 279]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 120]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 92]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 108]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (main__cp + 1 <= main__urilen && 1 == __VERIFIER_assert__cond) && (((((1 == __VERIFIER_assert__cond && 1 <= main__cp) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) || ((((((!(0 == __VERIFIER_assert__cond) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond)) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: ((((1 == __VERIFIER_assert__cond && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && ((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__c) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) || ((((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && main__c + 2 <= main__tokenlen) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) && main__c == 0) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((1 == __VERIFIER_assert__cond && main__cp < main__urilen && ((((((1 == __VERIFIER_assert__cond && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || ((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)))) && 1 == __VERIFIER_assert__cond) || ((main__cp + 1 == main__urilen && 1 == __VERIFIER_assert__cond) && main__cp < main__urilen && ((((((1 == __VERIFIER_assert__cond && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || ((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)))) - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: ((((((((1 == __VERIFIER_assert__cond && main__c + 2 <= main__tokenlen) && (!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && (1 == __VERIFIER_assert__cond && !(0 == __VERIFIER_assert__cond)) && ((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__c == 0) || ((((((((((1 == __VERIFIER_assert__cond && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__c) && (!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && (1 == __VERIFIER_assert__cond && !(0 == __VERIFIER_assert__cond)) && ((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond)) || ((((((1 <= main__cp && main__cp + 2 <= main__urilen) && 1 == __VERIFIER_assert__cond) && (!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && (1 == __VERIFIER_assert__cond && !(0 == __VERIFIER_assert__cond)) && ((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__c == 0) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: !(0 == __VERIFIER_assert__cond) - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 18 error locations. Result: SAFE, OverallTime: 7.1s, OverallIterations: 24, TraceHistogramMax: 2, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, HoareTripleCheckerStatistics: 1307 SDtfs, 2367 SDslu, 1508 SDs, 0 SdLazy, 1173 SolverSat, 131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 179 SyntacticMatches, 15 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 291 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 16 NumberOfFragments, 526 HoareAnnotationTreeSize, 6 FomulaSimplifications, 50296 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 4350 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 845 NumberOfCodeBlocks, 845 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 817 ConstructedInterpolants, 0 QuantifiedInterpolants, 57314 SizeOfPredicates, 25 NumberOfNonLiveVariables, 483 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 28 InterpolantComputations, 21 PerfectInterpolantSequences, 16/33 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...