./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 edfcf451b435e6b30ae37c75ee1e2f5c8348550f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 17:06:10,391 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:06:10,393 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:06:10,411 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:06:10,412 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:06:10,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:06:10,414 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:06:10,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:06:10,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:06:10,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:06:10,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:06:10,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:06:10,422 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:06:10,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:06:10,424 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:06:10,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:06:10,426 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:06:10,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:06:10,429 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:06:10,431 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:06:10,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:06:10,434 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:06:10,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:06:10,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:06:10,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:06:10,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:06:10,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:06:10,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:06:10,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:06:10,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:06:10,442 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:06:10,443 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:06:10,444 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:06:10,445 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:06:10,446 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:06:10,447 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:06:10,448 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:06:10,448 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:06:10,448 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:06:10,449 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:06:10,450 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:06:10,451 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:06:10,466 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:06:10,466 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:06:10,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:06:10,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:06:10,468 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:06:10,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:06:10,469 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:06:10,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:06:10,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:06:10,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:06:10,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:06:10,471 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:06:10,471 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:06:10,471 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:06:10,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:06:10,472 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:06:10,472 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:06:10,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:06:10,473 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:06:10,473 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:06:10,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:06:10,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:06:10,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:06:10,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:06:10,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:06:10,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:06:10,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:06:10,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:06:10,476 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:06:10,476 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> edfcf451b435e6b30ae37c75ee1e2f5c8348550f [2019-11-28 17:06:10,761 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:06:10,775 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:06:10,781 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:06:10,782 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:06:10,783 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:06:10,784 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-11-28 17:06:10,860 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4894db8f0/6b6b403218614b98a80fe3ea56b856aa/FLAGa772d61c8 [2019-11-28 17:06:11,381 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:06:11,381 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-11-28 17:06:11,392 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4894db8f0/6b6b403218614b98a80fe3ea56b856aa/FLAGa772d61c8 [2019-11-28 17:06:11,678 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4894db8f0/6b6b403218614b98a80fe3ea56b856aa [2019-11-28 17:06:11,682 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:06:11,683 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:06:11,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:06:11,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:06:11,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:06:11,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:06:11" (1/1) ... [2019-11-28 17:06:11,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@237185ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:11, skipping insertion in model container [2019-11-28 17:06:11,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:06:11" (1/1) ... [2019-11-28 17:06:11,707 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:06:11,766 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:06:12,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:06:12,059 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:06:12,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:06:12,175 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:06:12,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:12 WrapperNode [2019-11-28 17:06:12,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:06:12,176 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:06:12,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:06:12,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:06:12,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:12" (1/1) ... [2019-11-28 17:06:12,196 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:12" (1/1) ... [2019-11-28 17:06:12,237 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:06:12,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:06:12,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:06:12,239 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:06:12,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:12" (1/1) ... [2019-11-28 17:06:12,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:12" (1/1) ... [2019-11-28 17:06:12,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:12" (1/1) ... [2019-11-28 17:06:12,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:12" (1/1) ... [2019-11-28 17:06:12,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:12" (1/1) ... [2019-11-28 17:06:12,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:12" (1/1) ... [2019-11-28 17:06:12,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:12" (1/1) ... [2019-11-28 17:06:12,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:06:12,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:06:12,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:06:12,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:06:12,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 17:06:12,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:06:12,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:06:12,811 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:06:12,811 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 17:06:12,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:06:12 BoogieIcfgContainer [2019-11-28 17:06:12,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:06:12,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:06:12,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:06:12,817 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:06:12,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:06:11" (1/3) ... [2019-11-28 17:06:12,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366bcb5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:06:12, skipping insertion in model container [2019-11-28 17:06:12,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:12" (2/3) ... [2019-11-28 17:06:12,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366bcb5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:06:12, skipping insertion in model container [2019-11-28 17:06:12,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:06:12" (3/3) ... [2019-11-28 17:06:12,821 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2019-11-28 17:06:12,832 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:06:12,839 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-11-28 17:06:12,851 INFO L249 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-11-28 17:06:12,876 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:06:12,876 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:06:12,876 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:06:12,876 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:06:12,876 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:06:12,877 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:06:12,877 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:06:12,877 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:06:12,898 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2019-11-28 17:06:12,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 17:06:12,904 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:12,905 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:12,906 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:12,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:12,913 INFO L82 PathProgramCache]: Analyzing trace with hash 123971630, now seen corresponding path program 1 times [2019-11-28 17:06:12,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:12,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673350737] [2019-11-28 17:06:12,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:13,121 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-28 17:06:13,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673350737] [2019-11-28 17:06:13,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:13,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:06:13,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310799438] [2019-11-28 17:06:13,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:06:13,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:13,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:06:13,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:06:13,141 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 4 states. [2019-11-28 17:06:13,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:13,326 INFO L93 Difference]: Finished difference Result 130 states and 170 transitions. [2019-11-28 17:06:13,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:06:13,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 17:06:13,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:13,345 INFO L225 Difference]: With dead ends: 130 [2019-11-28 17:06:13,345 INFO L226 Difference]: Without dead ends: 109 [2019-11-28 17:06:13,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:13,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-28 17:06:13,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 65. [2019-11-28 17:06:13,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 17:06:13,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-11-28 17:06:13,399 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 8 [2019-11-28 17:06:13,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:13,400 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-11-28 17:06:13,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:06:13,400 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-11-28 17:06:13,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 17:06:13,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:13,401 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:13,402 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:13,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:13,403 INFO L82 PathProgramCache]: Analyzing trace with hash 120336139, now seen corresponding path program 1 times [2019-11-28 17:06:13,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:13,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061183053] [2019-11-28 17:06:13,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:13,461 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-28 17:06:13,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061183053] [2019-11-28 17:06:13,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:13,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:06:13,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150686093] [2019-11-28 17:06:13,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:06:13,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:13,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:06:13,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:06:13,465 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 4 states. [2019-11-28 17:06:13,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:13,550 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-11-28 17:06:13,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:06:13,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 17:06:13,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:13,552 INFO L225 Difference]: With dead ends: 65 [2019-11-28 17:06:13,552 INFO L226 Difference]: Without dead ends: 63 [2019-11-28 17:06:13,553 INFO L630 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-28 17:06:13,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-28 17:06:13,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-28 17:06:13,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-28 17:06:13,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-11-28 17:06:13,565 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 8 [2019-11-28 17:06:13,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:13,565 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-11-28 17:06:13,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:06:13,566 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-11-28 17:06:13,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 17:06:13,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:13,569 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:13,569 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:13,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:13,570 INFO L82 PathProgramCache]: Analyzing trace with hash -564542931, now seen corresponding path program 1 times [2019-11-28 17:06:13,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:13,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614598595] [2019-11-28 17:06:13,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:13,633 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-28 17:06:13,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614598595] [2019-11-28 17:06:13,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:13,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:06:13,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870660542] [2019-11-28 17:06:13,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:06:13,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:13,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:06:13,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:06:13,635 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2019-11-28 17:06:13,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:13,757 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-11-28 17:06:13,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:06:13,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-28 17:06:13,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:13,759 INFO L225 Difference]: With dead ends: 69 [2019-11-28 17:06:13,759 INFO L226 Difference]: Without dead ends: 67 [2019-11-28 17:06:13,763 INFO L630 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-28 17:06:13,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-28 17:06:13,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-11-28 17:06:13,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 17:06:13,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-11-28 17:06:13,772 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 9 [2019-11-28 17:06:13,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:13,772 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-11-28 17:06:13,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:06:13,773 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-11-28 17:06:13,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 17:06:13,773 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:13,774 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:13,774 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:13,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:13,774 INFO L82 PathProgramCache]: Analyzing trace with hash -429055130, now seen corresponding path program 1 times [2019-11-28 17:06:13,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:13,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608911650] [2019-11-28 17:06:13,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:13,848 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-28 17:06:13,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608911650] [2019-11-28 17:06:13,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:13,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:13,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417781873] [2019-11-28 17:06:13,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:13,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:13,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:13,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:13,851 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2019-11-28 17:06:13,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:13,939 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-11-28 17:06:13,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:06:13,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 17:06:13,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:13,941 INFO L225 Difference]: With dead ends: 66 [2019-11-28 17:06:13,941 INFO L226 Difference]: Without dead ends: 64 [2019-11-28 17:06:13,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:06:13,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-28 17:06:13,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-28 17:06:13,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-28 17:06:13,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-11-28 17:06:13,949 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 11 [2019-11-28 17:06:13,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:13,949 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-11-28 17:06:13,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:13,949 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-11-28 17:06:13,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 17:06:13,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:13,950 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:13,951 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:13,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:13,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1359750351, now seen corresponding path program 1 times [2019-11-28 17:06:13,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:13,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478818520] [2019-11-28 17:06:13,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:14,001 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-28 17:06:14,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478818520] [2019-11-28 17:06:14,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:14,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:14,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852156031] [2019-11-28 17:06:14,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:14,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:14,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:14,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:14,004 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 5 states. [2019-11-28 17:06:14,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:14,106 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-11-28 17:06:14,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:06:14,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 17:06:14,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:14,108 INFO L225 Difference]: With dead ends: 65 [2019-11-28 17:06:14,108 INFO L226 Difference]: Without dead ends: 63 [2019-11-28 17:06:14,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:06:14,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-28 17:06:14,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-11-28 17:06:14,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-28 17:06:14,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-11-28 17:06:14,115 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 11 [2019-11-28 17:06:14,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:14,115 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-11-28 17:06:14,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:14,115 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-11-28 17:06:14,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 17:06:14,116 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:14,116 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:14,117 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:14,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:14,117 INFO L82 PathProgramCache]: Analyzing trace with hash -415802953, now seen corresponding path program 1 times [2019-11-28 17:06:14,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:14,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497845661] [2019-11-28 17:06:14,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:14,176 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-28 17:06:14,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497845661] [2019-11-28 17:06:14,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:14,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:06:14,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5210184] [2019-11-28 17:06:14,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:06:14,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:14,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:06:14,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:06:14,182 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 4 states. [2019-11-28 17:06:14,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:14,257 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2019-11-28 17:06:14,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:06:14,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-28 17:06:14,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:14,258 INFO L225 Difference]: With dead ends: 63 [2019-11-28 17:06:14,258 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 17:06:14,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:14,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 17:06:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-11-28 17:06:14,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-28 17:06:14,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-11-28 17:06:14,265 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 12 [2019-11-28 17:06:14,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:14,265 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-11-28 17:06:14,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:06:14,266 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-11-28 17:06:14,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 17:06:14,267 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:14,267 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:14,267 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:14,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:14,268 INFO L82 PathProgramCache]: Analyzing trace with hash -415312395, now seen corresponding path program 1 times [2019-11-28 17:06:14,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:14,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476127391] [2019-11-28 17:06:14,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:14,354 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-28 17:06:14,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476127391] [2019-11-28 17:06:14,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:14,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:14,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443611390] [2019-11-28 17:06:14,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:14,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:14,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:14,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:14,358 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 5 states. [2019-11-28 17:06:14,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:14,494 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2019-11-28 17:06:14,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:06:14,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 17:06:14,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:14,495 INFO L225 Difference]: With dead ends: 100 [2019-11-28 17:06:14,496 INFO L226 Difference]: Without dead ends: 98 [2019-11-28 17:06:14,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:06:14,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-28 17:06:14,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 56. [2019-11-28 17:06:14,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 17:06:14,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-11-28 17:06:14,505 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 12 [2019-11-28 17:06:14,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:14,506 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-11-28 17:06:14,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:14,507 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-11-28 17:06:14,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 17:06:14,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:14,509 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:14,509 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:14,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:14,510 INFO L82 PathProgramCache]: Analyzing trace with hash 797416153, now seen corresponding path program 1 times [2019-11-28 17:06:14,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:14,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016943315] [2019-11-28 17:06:14,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:14,597 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-28 17:06:14,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016943315] [2019-11-28 17:06:14,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:14,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:06:14,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695672657] [2019-11-28 17:06:14,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:06:14,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:14,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:06:14,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:06:14,601 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 4 states. [2019-11-28 17:06:14,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:14,668 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2019-11-28 17:06:14,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:06:14,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-28 17:06:14,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:14,669 INFO L225 Difference]: With dead ends: 57 [2019-11-28 17:06:14,670 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 17:06:14,670 INFO L630 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-28 17:06:14,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 17:06:14,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-11-28 17:06:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 17:06:14,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-11-28 17:06:14,681 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 12 [2019-11-28 17:06:14,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:14,681 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-11-28 17:06:14,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:06:14,682 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-11-28 17:06:14,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 17:06:14,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:14,684 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:14,684 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:14,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:14,685 INFO L82 PathProgramCache]: Analyzing trace with hash 10221853, now seen corresponding path program 1 times [2019-11-28 17:06:14,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:14,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190539072] [2019-11-28 17:06:14,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:14,795 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-28 17:06:14,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190539072] [2019-11-28 17:06:14,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:14,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:14,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471231727] [2019-11-28 17:06:14,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:14,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:14,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:14,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:14,798 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2019-11-28 17:06:14,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:14,928 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2019-11-28 17:06:14,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:06:14,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-28 17:06:14,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:14,929 INFO L225 Difference]: With dead ends: 91 [2019-11-28 17:06:14,929 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 17:06:14,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-28 17:06:14,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 17:06:14,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 50. [2019-11-28 17:06:14,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 17:06:14,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-11-28 17:06:14,935 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 13 [2019-11-28 17:06:14,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:14,936 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-11-28 17:06:14,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:14,936 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-11-28 17:06:14,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 17:06:14,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:14,937 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:14,937 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:14,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:14,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1032848570, now seen corresponding path program 1 times [2019-11-28 17:06:14,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:14,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822496252] [2019-11-28 17:06:14,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:14,979 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-28 17:06:14,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822496252] [2019-11-28 17:06:14,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:14,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:14,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748387106] [2019-11-28 17:06:14,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:14,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:14,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:14,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:14,983 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2019-11-28 17:06:15,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:15,081 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2019-11-28 17:06:15,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:06:15,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-28 17:06:15,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:15,085 INFO L225 Difference]: With dead ends: 68 [2019-11-28 17:06:15,085 INFO L226 Difference]: Without dead ends: 66 [2019-11-28 17:06:15,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:06:15,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-28 17:06:15,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 48. [2019-11-28 17:06:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 17:06:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-11-28 17:06:15,095 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 13 [2019-11-28 17:06:15,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:15,098 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-11-28 17:06:15,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:15,099 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-11-28 17:06:15,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 17:06:15,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:15,103 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:15,104 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:15,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:15,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1031124666, now seen corresponding path program 1 times [2019-11-28 17:06:15,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:15,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819150007] [2019-11-28 17:06:15,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:15,205 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-28 17:06:15,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819150007] [2019-11-28 17:06:15,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:15,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 17:06:15,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603403662] [2019-11-28 17:06:15,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:06:15,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:15,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:06:15,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:06:15,208 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 6 states. [2019-11-28 17:06:15,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:15,290 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-11-28 17:06:15,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:06:15,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-28 17:06:15,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:15,291 INFO L225 Difference]: With dead ends: 49 [2019-11-28 17:06:15,291 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 17:06:15,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:06:15,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 17:06:15,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-11-28 17:06:15,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 17:06:15,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-11-28 17:06:15,297 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 13 [2019-11-28 17:06:15,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:15,298 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-11-28 17:06:15,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:06:15,298 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-11-28 17:06:15,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 17:06:15,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:15,299 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:15,300 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:15,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:15,300 INFO L82 PathProgramCache]: Analyzing trace with hash 310078394, now seen corresponding path program 1 times [2019-11-28 17:06:15,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:15,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208733806] [2019-11-28 17:06:15,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:15,379 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-28 17:06:15,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208733806] [2019-11-28 17:06:15,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:15,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:15,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015433885] [2019-11-28 17:06:15,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:15,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:15,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:15,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:15,381 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2019-11-28 17:06:15,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:15,451 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-11-28 17:06:15,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:06:15,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 17:06:15,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:15,453 INFO L225 Difference]: With dead ends: 46 [2019-11-28 17:06:15,453 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 17:06:15,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-28 17:06:15,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 17:06:15,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-11-28 17:06:15,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 17:06:15,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-11-28 17:06:15,465 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2019-11-28 17:06:15,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:15,468 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-11-28 17:06:15,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:15,468 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-11-28 17:06:15,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 17:06:15,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:15,469 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:15,470 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:15,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:15,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1953530500, now seen corresponding path program 1 times [2019-11-28 17:06:15,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:15,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044352412] [2019-11-28 17:06:15,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:15,564 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-28 17:06:15,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044352412] [2019-11-28 17:06:15,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:15,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:15,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737609138] [2019-11-28 17:06:15,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:15,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:15,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:15,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:15,567 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2019-11-28 17:06:15,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:15,657 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-11-28 17:06:15,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:06:15,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 17:06:15,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:15,658 INFO L225 Difference]: With dead ends: 57 [2019-11-28 17:06:15,658 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 17:06:15,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:06:15,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 17:06:15,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2019-11-28 17:06:15,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 17:06:15,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-28 17:06:15,664 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 14 [2019-11-28 17:06:15,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:15,665 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-28 17:06:15,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:15,665 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-11-28 17:06:15,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 17:06:15,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:15,669 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:15,669 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:15,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:15,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1951983355, now seen corresponding path program 1 times [2019-11-28 17:06:15,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:15,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492833569] [2019-11-28 17:06:15,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:15,754 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-28 17:06:15,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492833569] [2019-11-28 17:06:15,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:15,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 17:06:15,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70643591] [2019-11-28 17:06:15,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:06:15,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:15,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:06:15,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:06:15,758 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 6 states. [2019-11-28 17:06:15,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:15,842 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2019-11-28 17:06:15,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:06:15,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-28 17:06:15,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:15,844 INFO L225 Difference]: With dead ends: 61 [2019-11-28 17:06:15,844 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 17:06:15,844 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:06:15,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 17:06:15,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2019-11-28 17:06:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 17:06:15,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-11-28 17:06:15,848 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 14 [2019-11-28 17:06:15,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:15,848 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-28 17:06:15,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:06:15,848 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-11-28 17:06:15,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 17:06:15,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:15,849 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:15,849 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:15,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:15,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1900089420, now seen corresponding path program 1 times [2019-11-28 17:06:15,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:15,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707593663] [2019-11-28 17:06:15,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:15,926 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-28 17:06:15,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707593663] [2019-11-28 17:06:15,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:15,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 17:06:15,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704035573] [2019-11-28 17:06:15,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:06:15,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:15,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:06:15,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:06:15,928 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2019-11-28 17:06:16,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:16,003 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-11-28 17:06:16,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:06:16,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-28 17:06:16,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:16,004 INFO L225 Difference]: With dead ends: 37 [2019-11-28 17:06:16,004 INFO L226 Difference]: Without dead ends: 33 [2019-11-28 17:06:16,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:06:16,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-28 17:06:16,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-28 17:06:16,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 17:06:16,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-28 17:06:16,008 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2019-11-28 17:06:16,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:16,008 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-28 17:06:16,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:06:16,008 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-11-28 17:06:16,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 17:06:16,009 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:16,009 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:16,009 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:16,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:16,010 INFO L82 PathProgramCache]: Analyzing trace with hash -381937728, now seen corresponding path program 1 times [2019-11-28 17:06:16,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:16,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642130988] [2019-11-28 17:06:16,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:16,075 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-28 17:06:16,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642130988] [2019-11-28 17:06:16,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:16,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 17:06:16,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963998808] [2019-11-28 17:06:16,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:06:16,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:16,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:06:16,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:06:16,080 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 6 states. [2019-11-28 17:06:16,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:16,171 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-11-28 17:06:16,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:06:16,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-28 17:06:16,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:16,172 INFO L225 Difference]: With dead ends: 48 [2019-11-28 17:06:16,172 INFO L226 Difference]: Without dead ends: 46 [2019-11-28 17:06:16,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:06:16,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-28 17:06:16,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2019-11-28 17:06:16,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 17:06:16,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-11-28 17:06:16,178 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 15 [2019-11-28 17:06:16,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:16,178 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-11-28 17:06:16,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:06:16,179 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-11-28 17:06:16,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 17:06:16,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:16,179 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:16,179 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:16,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:16,180 INFO L82 PathProgramCache]: Analyzing trace with hash -441974753, now seen corresponding path program 1 times [2019-11-28 17:06:16,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:16,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684878842] [2019-11-28 17:06:16,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:16,235 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-28 17:06:16,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684878842] [2019-11-28 17:06:16,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:16,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 17:06:16,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939715785] [2019-11-28 17:06:16,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:06:16,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:16,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:06:16,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:06:16,238 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2019-11-28 17:06:16,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:16,335 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-11-28 17:06:16,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:06:16,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-28 17:06:16,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:16,339 INFO L225 Difference]: With dead ends: 52 [2019-11-28 17:06:16,339 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 17:06:16,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:06:16,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 17:06:16,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 29. [2019-11-28 17:06:16,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 17:06:16,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-11-28 17:06:16,346 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 16 [2019-11-28 17:06:16,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:16,346 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-11-28 17:06:16,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:06:16,346 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-11-28 17:06:16,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:06:16,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:16,347 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:16,348 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:16,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:16,348 INFO L82 PathProgramCache]: Analyzing trace with hash -816311340, now seen corresponding path program 1 times [2019-11-28 17:06:16,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:16,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894323001] [2019-11-28 17:06:16,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:16,377 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-28 17:06:16,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894323001] [2019-11-28 17:06:16,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:16,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:06:16,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891478668] [2019-11-28 17:06:16,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:06:16,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:16,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:06:16,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:06:16,379 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 4 states. [2019-11-28 17:06:16,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:16,424 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-11-28 17:06:16,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:06:16,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-28 17:06:16,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:16,425 INFO L225 Difference]: With dead ends: 33 [2019-11-28 17:06:16,425 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 17:06:16,426 INFO L630 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-28 17:06:16,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 17:06:16,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 17:06:16,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 17:06:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 17:06:16,426 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-11-28 17:06:16,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:16,427 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 17:06:16,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:06:16,427 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 17:06:16,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 17:06:16,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 17:06:16,772 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-11-28 17:06:16,772 INFO L246 CegarLoopResult]: For program point L27(lines 27 363) no Hoare annotation was computed. [2019-11-28 17:06:16,773 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2019-11-28 17:06:16,773 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-28 17:06:16,773 INFO L246 CegarLoopResult]: For program point L19(lines 19 364) no Hoare annotation was computed. [2019-11-28 17:06:16,773 INFO L246 CegarLoopResult]: For program point L110(line 110) no Hoare annotation was computed. [2019-11-28 17:06:16,773 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2019-11-28 17:06:16,773 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2019-11-28 17:06:16,773 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 17:06:16,773 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 17:06:16,774 INFO L246 CegarLoopResult]: For program point L284(lines 284 358) no Hoare annotation was computed. [2019-11-28 17:06:16,774 INFO L246 CegarLoopResult]: For program point L218(lines 218 240) no Hoare annotation was computed. [2019-11-28 17:06:16,774 INFO L246 CegarLoopResult]: For program point L78(lines 78 88) no Hoare annotation was computed. [2019-11-28 17:06:16,774 INFO L246 CegarLoopResult]: For program point L334(line 334) no Hoare annotation was computed. [2019-11-28 17:06:16,774 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2019-11-28 17:06:16,774 INFO L246 CegarLoopResult]: For program point L136(lines 136 158) no Hoare annotation was computed. [2019-11-28 17:06:16,774 INFO L246 CegarLoopResult]: For program point L37(lines 37 251) no Hoare annotation was computed. [2019-11-28 17:06:16,774 INFO L246 CegarLoopResult]: For program point L293(line 293) no Hoare annotation was computed. [2019-11-28 17:06:16,774 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2019-11-28 17:06:16,775 INFO L246 CegarLoopResult]: For program point L120(lines 120 197) no Hoare annotation was computed. [2019-11-28 17:06:16,775 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-11-28 17:06:16,775 INFO L249 CegarLoopResult]: At program point L310(lines 27 363) the Hoare annotation is: true [2019-11-28 17:06:16,775 INFO L246 CegarLoopResult]: For program point L211(lines 211 246) no Hoare annotation was computed. [2019-11-28 17:06:16,775 INFO L249 CegarLoopResult]: At program point L368(lines 10 370) the Hoare annotation is: true [2019-11-28 17:06:16,775 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2019-11-28 17:06:16,775 INFO L246 CegarLoopResult]: For program point L170(lines 170 194) no Hoare annotation was computed. [2019-11-28 17:06:16,776 INFO L246 CegarLoopResult]: For program point L261(lines 261 361) no Hoare annotation was computed. [2019-11-28 17:06:16,776 INFO L246 CegarLoopResult]: For program point L129(lines 129 196) no Hoare annotation was computed. [2019-11-28 17:06:16,776 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2019-11-28 17:06:16,776 INFO L242 CegarLoopResult]: At program point L352(lines 278 359) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~13))) [2019-11-28 17:06:16,776 INFO L246 CegarLoopResult]: For program point L220(line 220) no Hoare annotation was computed. [2019-11-28 17:06:16,776 INFO L246 CegarLoopResult]: For program point L344(lines 344 353) no Hoare annotation was computed. [2019-11-28 17:06:16,776 INFO L242 CegarLoopResult]: At program point L245(lines 97 247) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~main__t~0) (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) [2019-11-28 17:06:16,777 INFO L246 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-28 17:06:16,777 INFO L246 CegarLoopResult]: For program point L303(lines 303 311) no Hoare annotation was computed. [2019-11-28 17:06:16,777 INFO L246 CegarLoopResult]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-28 17:06:16,777 INFO L246 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-28 17:06:16,777 INFO L246 CegarLoopResult]: For program point L97(lines 97 247) no Hoare annotation was computed. [2019-11-28 17:06:16,777 INFO L246 CegarLoopResult]: For program point L320(lines 320 357) no Hoare annotation was computed. [2019-11-28 17:06:16,777 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2019-11-28 17:06:16,777 INFO L246 CegarLoopResult]: For program point L122(line 122) no Hoare annotation was computed. [2019-11-28 17:06:16,777 INFO L246 CegarLoopResult]: For program point L15(lines 15 369) no Hoare annotation was computed. [2019-11-28 17:06:16,778 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2019-11-28 17:06:16,778 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-28 17:06:16,778 INFO L246 CegarLoopResult]: For program point L230(lines 230 238) no Hoare annotation was computed. [2019-11-28 17:06:16,778 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 17:06:16,778 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-11-28 17:06:16,778 INFO L246 CegarLoopResult]: For program point L346(line 346) no Hoare annotation was computed. [2019-11-28 17:06:16,778 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-11-28 17:06:16,778 INFO L246 CegarLoopResult]: For program point L148(lines 148 156) no Hoare annotation was computed. [2019-11-28 17:06:16,778 INFO L246 CegarLoopResult]: For program point L49(lines 49 249) no Hoare annotation was computed. [2019-11-28 17:06:16,779 INFO L246 CegarLoopResult]: For program point L305(line 305) no Hoare annotation was computed. [2019-11-28 17:06:16,779 INFO L246 CegarLoopResult]: For program point L272(lines 272 359) no Hoare annotation was computed. [2019-11-28 17:06:16,779 INFO L246 CegarLoopResult]: For program point L66(lines 66 90) no Hoare annotation was computed. [2019-11-28 17:06:16,779 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 17:06:16,779 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-11-28 17:06:16,779 INFO L246 CegarLoopResult]: For program point L182(lines 182 192) no Hoare annotation was computed. [2019-11-28 17:06:16,779 INFO L246 CegarLoopResult]: For program point L108(lines 108 199) no Hoare annotation was computed. [2019-11-28 17:06:16,779 INFO L246 CegarLoopResult]: For program point L232(line 232) no Hoare annotation was computed. [2019-11-28 17:06:16,780 INFO L242 CegarLoopResult]: At program point L323(lines 27 363) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0)) [2019-11-28 17:06:16,780 INFO L242 CegarLoopResult]: At program point L191(lines 55 249) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) [2019-11-28 17:06:16,780 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2019-11-28 17:06:16,780 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-11-28 17:06:16,780 INFO L246 CegarLoopResult]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-28 17:06:16,780 INFO L246 CegarLoopResult]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-28 17:06:16,780 INFO L246 CegarLoopResult]: For program point L274(line 274) no Hoare annotation was computed. [2019-11-28 17:06:16,780 INFO L246 CegarLoopResult]: For program point L332(lines 332 355) no Hoare annotation was computed. [2019-11-28 17:06:16,781 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2019-11-28 17:06:16,781 INFO L246 CegarLoopResult]: For program point L101(lines 101 205) no Hoare annotation was computed. [2019-11-28 17:06:16,781 INFO L246 CegarLoopResult]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-28 17:06:16,781 INFO L246 CegarLoopResult]: For program point L291(lines 291 313) no Hoare annotation was computed. [2019-11-28 17:06:16,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:06:16 BoogieIcfgContainer [2019-11-28 17:06:16,803 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:06:16,803 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:06:16,803 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:06:16,803 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:06:16,804 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:06:12" (3/4) ... [2019-11-28 17:06:16,808 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 17:06:16,820 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 17:06:16,821 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 17:06:16,899 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:06:16,899 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:06:16,905 INFO L168 Benchmark]: Toolchain (without parser) took 5221.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.0 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -122.6 MB). Peak memory consumption was 82.4 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:16,905 INFO L168 Benchmark]: CDTParser took 0.85 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:06:16,906 INFO L168 Benchmark]: CACSL2BoogieTranslator took 485.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:16,906 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:06:16,906 INFO L168 Benchmark]: Boogie Preprocessor took 26.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:06:16,907 INFO L168 Benchmark]: RCFGBuilder took 547.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:16,907 INFO L168 Benchmark]: TraceAbstraction took 3989.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.5 MB). Peak memory consumption was 85.0 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:16,907 INFO L168 Benchmark]: Witness Printer took 95.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-28 17:06:16,909 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.85 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 485.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 547.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3989.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.5 MB). Peak memory consumption was 85.0 MB. Max. memory is 11.5 GB. * Witness Printer took 95.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: 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: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 346]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 334]: 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: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 274]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 122]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 138]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 220]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 305]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 293]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 232]: 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 - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && 1 <= main__t) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((1 <= main__t && main__t + 1 <= main__tagbuf_len) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: (main__t + 1 <= main__tagbuf_len && 0 <= main__t) && !(0 == __VERIFIER_assert__cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 71 locations, 17 error locations. Result: SAFE, OverallTime: 3.5s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 726 SDtfs, 1259 SDslu, 649 SDs, 0 SdLazy, 990 SolverSat, 125 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred 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, 18 MinimizatonAttempts, 225 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 56 HoareAnnotationTreeSize, 6 FomulaSimplifications, 80270 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 1102 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 7089 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...